Built with doc-gen4, running Lean4. Bubbles () indicate interactive fragments: hover for details, tap to reveal contents. Use Ctrl+โ†‘Ctrl+โ†“to navigate, Ctrl+๐Ÿ–ฑ๏ธto focus. On Mac, use Cmdinstead of Ctrl. 
import Mathlib.Data.Vector
import Mathlib.Data.Bitvec.Basic
import Mathlib.Algebra.Group.InjSurj
import Mathlib.Tactic.Ring
import Mathlib.Data.Int.Cast.Lemmas
import Mathlib.Data.ZMod.Basic
import Mathlib.Order.Basic

namespace Vector


instance: {ฮฑ : Type u} โ†’ {n : โ„•} โ†’ GetElem (Vector ฮฑ n) (Fin n) ฮฑ fun x x => True
instance {
ฮฑ: Type u
ฮฑ : 
Type u: Type (u+1)
Type u} {
n: โ„•
n : 
Nat: Type
Nat} : 
GetElem: (cont : Type ?u.8) โ†’
  (idx : Type ?u.7) โ†’ outParam (Type ?u.6) โ†’ outParam (cont โ†’ idx โ†’ Prop) โ†’ Type (max(max?u.8?u.7)?u.6)
GetElem (
Vector: Type ?u.9 โ†’ โ„• โ†’ Type ?u.9
Vector 
ฮฑ: Type u
ฮฑ 
n: โ„•
n) (
Fin: โ„• โ†’ Type
Fin 
n: โ„•
n) 
ฮฑ: Type u
ฮฑ (fun 
_: ?m.11
_ 
_: ?m.14
_ => 
True: Prop
True) where
  getElem := fun 
v: ?m.45
v 
i: ?m.48
i 
_: ?m.51
_ => 
v: ?m.45
v.
1: {ฮฑ : Sort ?u.62} โ†’ {p : ฮฑ โ†’ Prop} โ†’ Subtype p โ†’ ฮฑ
1[
i: ?m.48
i.
val: {n : โ„•} โ†’ Fin n โ†’ โ„•
val]

@[simp]
theorem 
getElem_eq_get: โˆ€ {ฮฑ : Type u} {n : โ„•} (v : Vector ฮฑ n) (i : Fin n), v[i] = get v i
getElem_eq_get {
ฮฑ: Type u
ฮฑ : 
Type u: Type (u+1)
Type u} {
n: โ„•
n : 
Nat: Type
Nat} (
v: Vector ฮฑ n
v : 
Vector: Type ?u.634 โ†’ โ„• โ†’ Type ?u.634
Vector 
ฮฑ: Type u
ฮฑ 
n: โ„•
n) (
i: Fin n
i : 
Fin: โ„• โ†’ Type
Fin 
n: โ„•
n) : 
v: Vector ฮฑ n
v[
i: Fin n
i] = 
v: Vector ฮฑ n
v.
get: {ฮฑ : Type ?u.689} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ Fin n โ†’ ฮฑ
get 
i: Fin n
i := 
rfl: โˆ€ {ฮฑ : Sort ?u.817} {a : ฮฑ}, a = a
rfl

end Vector

namespace Bitvec

def 
width: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
width : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.869
n โ†’ 
Nat: Type
Nat := fun 
_: ?m.877
_ => 
n: โ„•
n

-- Shouldn't this be inferred from the instance above? (as Bitvec is @[reducible])

instance: {n : โ„•} โ†’ GetElem (Bitvec n) (Fin n) Bool fun x x => True
instance {
n: โ„•
n : 
Nat: Type
Nat} : 
GetElem: (cont : Type ?u.917) โ†’
  (idx : Type ?u.916) โ†’ outParam (Type ?u.915) โ†’ outParam (cont โ†’ idx โ†’ Prop) โ†’ Type (max(max?u.917?u.916)?u.915)
GetElem (
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) (
Fin: โ„• โ†’ Type
Fin 
n: โ„•
n) 
Bool: Type
Bool (fun 
_: ?m.919
_ 
_: ?m.922
_ => 
True: Prop
True) where
  getElem := fun 
v: ?m.948
v 
i: ?m.951
i 
_: ?m.954
_ => 
v: ?m.948
v.
1: {ฮฑ : Sort ?u.965} โ†’ {p : ฮฑ โ†’ Prop} โ†’ Subtype p โ†’ ฮฑ
1[
i: ?m.951
i.
val: {n : โ„•} โ†’ Fin n โ†’ โ„•
val]


instance: (n : โ„•) โ†’ Inhabited (Bitvec n)
instance (
n: โ„•
n : 
Nat: Type
Nat) : 
Inhabited: Sort ?u.1488 โ†’ Sort (max1?u.1488)
Inhabited (
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) :=
  โŸจ
List.replicate: {ฮฑ : Type ?u.1508} โ†’ โ„• โ†’ ฮฑ โ†’ List ฮฑ
List.replicate 
n: โ„•
n 
true: Bool
true, 
Goals accomplished! ๐Ÿ™
n: โ„•

List.length (List.replicate n true) = n
Goals accomplished! ๐Ÿ™
โŸฉ

def 
Fun: (width : โ„•) โ†’ ?m.1584 width
Fun (
width: โ„•
width : 
Nat: Type
Nat) := 
Fin: โ„• โ†’ Type
Fin 
width: โ„•
width โ†’ 
Bool: Type
Bool

def 
ofInt': (n : โ„•) โ†’ โ„ค โ†’ Bitvec n
ofInt' (
n: โ„•
n : 
Nat: Type
Nat) (
z: โ„ค
z : 
Int: Type
Int) : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n :=
  match 
n: โ„•
n with
    | 
0: โ„•
0 => โŸจ
List.nil: {ฮฑ : Type ?u.1633} โ†’ List ฮฑ
List.nil, 
rfl: โˆ€ {ฮฑ : Sort ?u.1636} {a : ฮฑ}, a = a
rflโŸฉ
    | 
m: โ„•
m + 1 => 
Bitvec.ofInt: (n : โ„•) โ†’ โ„ค โ†’ Bitvec (Nat.succ n)
Bitvec.ofInt 
m: โ„•
m 
z: โ„ค
z

/-- convert `Bitvec n` to `Fin n โ†’ Bool` -/
def 
ofFun: {width : โ„•} โ†’ Fun width โ†’ Bitvec width
ofFun {
width: โ„•
width : 
Nat: Type
Nat} : 
Fun: โ„• โ†’ Type
Fun 
width: โ„•
width โ†’ 
Bitvec: โ„• โ†’ Type
Bitvec 
width: โ„•
width :=
  
Vector.ofFn: {ฮฑ : Type ?u.1904} โ†’ {n : โ„•} โ†’ (Fin n โ†’ ฮฑ) โ†’ Vector ฮฑ n
Vector.ofFn

/-- convert `Fin n โ†’ Bool` to `Bitvec n` -/
def 
toFun: {width : โ„•} โ†’ Bitvec width โ†’ Fun width
toFun {
width: โ„•
width : 
Nat: Type
Nat} : 
Bitvec: โ„• โ†’ Type
Bitvec 
width: โ„•
width โ†’ 
Fun: โ„• โ†’ Type
Fun 
width: โ„•
width :=
    
Vector.get: {ฮฑ : Type ?u.1958} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ Fin n โ†’ ฮฑ
Vector.get


instance: {width : โ„•} โ†’ Coe (Fun width) (Bitvec width)
instance {
width: โ„•
width : 
Nat: Type
Nat} : 
Coe: semiOutParam (Sort ?u.2016) โ†’ Sort ?u.2015 โ†’ Sort (max(max1?u.2016)?u.2015)
Coe (
Fun: โ„• โ†’ Type
Fun 
width: โ„•
width) (
Bitvec: โ„• โ†’ Type
Bitvec 
width: โ„•
width) := โŸจ@
ofFun: {width : โ„•} โ†’ Fun width โ†’ Bitvec width
ofFun 
width: โ„•
widthโŸฉ

instance: {width : โ„•} โ†’ Coe (Bitvec width) (Fun width)
instance {
width: โ„•
width : 
Nat: Type
Nat} : 
Coe: semiOutParam (Sort ?u.2097) โ†’ Sort ?u.2096 โ†’ Sort (max(max1?u.2097)?u.2096)
Coe (
Bitvec: โ„• โ†’ Type
Bitvec 
width: โ„•
width) (
Fun: โ„• โ†’ Type
Fun 
width: โ„•
width) := โŸจ@
toFun: {width : โ„•} โ†’ Bitvec width โ†’ Fun width
toFun 
width: โ„•
widthโŸฉ

def 
ofVector: {n : โ„•} โ†’ Vector Bool n โ†’ Bitvec n
ofVector : 
Vector: Type ?u.2179 โ†’ โ„• โ†’ Type ?u.2179
Vector 
Bool: Type
Bool 
n: ?m.2175
n โ†’ 
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.2175
n := 
id: {ฮฑ : Sort ?u.2185} โ†’ ฮฑ โ†’ ฮฑ
id

-- inspired by: https://leanprover.zulipchat.com/#narrow/stream/270676-lean4/topic/Defining.20my.20own.20numerals
-- not ideal solution, as hard to type, but should be ok for now
prefix:max "๐Ÿถ"   => fun v => 
ofVector: {n : โ„•} โ†’ Vector Bool n โ†’ Bitvec n
ofVector (
Vector.cons: {ฮฑ : Type u} โ†’ {n : โ„•} โ†’ ฮฑ โ†’ Vector ฮฑ n โ†’ Vector ฮฑ (Nat.succ n)
Vector.cons 
false: Bool
false v)
prefix:max "๐Ÿท"   => fun v => 
ofVector: {n : โ„•} โ†’ Vector Bool n โ†’ Bitvec n
ofVector (
Vector.cons: {ฮฑ : Type u} โ†’ {n : โ„•} โ†’ ฮฑ โ†’ Vector ฮฑ n โ†’ Vector ฮฑ (Nat.succ n)
Vector.cons 
true: Bool
true v)
notation:max "๐Ÿถ"   => 
ofVector: {n : โ„•} โ†’ Vector Bool n โ†’ Bitvec n
ofVector (
Vector.cons: {ฮฑ : Type u} โ†’ {n : โ„•} โ†’ ฮฑ โ†’ Vector ฮฑ n โ†’ Vector ฮฑ (Nat.succ n)
Vector.cons 
false: Bool
false (@
Vector.nil: {ฮฑ : Type u} โ†’ Vector ฮฑ 0
Vector.nil 
Bool: Type
Bool))
notation:max "๐Ÿท"   => 
ofVector: {n : โ„•} โ†’ Vector Bool n โ†’ Bitvec n
ofVector (
Vector.cons: {ฮฑ : Type u} โ†’ {n : โ„•} โ†’ ฮฑ โ†’ Vector ฮฑ n โ†’ Vector ฮฑ (Nat.succ n)
Vector.cons 
true: Bool
true (@
Vector.nil: {ฮฑ : Type u} โ†’ Vector ฮฑ 0
Vector.nil 
Bool: Type
Bool))


instance: {n : โ„•} โ†’ Add (Bitvec n)
instance : 
Add: Type ?u.125082 โ†’ Type ?u.125082
Add (
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.125079
n) where add := 
Bitvec.add: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Bitvec n
Bitvec.add

instance: {n : โ„•} โ†’ Sub (Bitvec n)
instance : 
Sub: Type ?u.125176 โ†’ Type ?u.125176
Sub (
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.125173
n) where sub := 
Bitvec.sub: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Bitvec n
Bitvec.sub

-- examples:
-- #eval (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท).toNat
-- #eval (๐Ÿถ๐Ÿท๐Ÿท๐Ÿท).toNat
-- #eval (๐Ÿถ๐Ÿท๐Ÿท๐Ÿท) + (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท) |>.toNat
-- #eval ๐Ÿท๐Ÿถ๐Ÿท๐Ÿท + ๐Ÿถ๐Ÿท๐Ÿท๐Ÿท
-- #eval Bitvec.adc (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท) (๐Ÿถ๐Ÿท๐Ÿท๐Ÿท) true
-- #eval Bitvec.adc (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท) (๐Ÿถ๐Ÿท๐Ÿท๐Ÿท) false
-- #eval Bitvec.adc (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท) (๐Ÿถ๐Ÿท๐Ÿท๐Ÿท) true |>.toNat
-- #eval Bitvec.adc (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท) (๐Ÿถ๐Ÿท๐Ÿท๐Ÿท) false |>.toNat
-- 
-- #eval Bitvec.adc (๐Ÿถ) (๐Ÿถ) true
-- #eval Bitvec.adc (๐Ÿถ) (๐Ÿถ) false

def 
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod {
n: โ„•
n : 
Nat: Type
Nat} (
x: Bitvec n
x : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) : 
ZMod: โ„• โ†’ Type
ZMod (
2: ?m.125273
2 ^ 
n: โ„•
n) := 
  
x: Bitvec n
x.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat

theorem 
toZMod_val: โˆ€ {n : โ„•} (v : Bitvec n), ZMod.val (toZMod v) = Bitvec.toNat v
toZMod_val {
n: โ„•
n : 
โ„•: Type
โ„•} (
v: Bitvec n
v : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) : (
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod 
v: Bitvec n
v).
val: {n : โ„•} โ†’ ZMod n โ†’ โ„•
val = 
v: Bitvec n
v.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat := 
Goals accomplished! ๐Ÿ™
n: โ„•

v: Bitvec n

ZMod.val (toZMod v) = Bitvec.toNat v
n: โ„•

v: Bitvec n

ZMod.val (toZMod v) = Bitvec.toNat v
n: โ„•

v: Bitvec n

ZMod.val โ†‘(Bitvec.toNat v) = Bitvec.toNat v
n: โ„•

v: Bitvec n

ZMod.val (toZMod v) = Bitvec.toNat v
n: โ„•

v: Bitvec n

Bitvec.toNat v % 2 ^ n = Bitvec.toNat v
n: โ„•

v: Bitvec n

ZMod.val (toZMod v) = Bitvec.toNat v
n: โ„•

v: Bitvec n

Bitvec.toNat v = Bitvec.toNat v
n: โ„•

v: Bitvec n

Bitvec.toNat v < 2 ^ n
n: โ„•

v: Bitvec n

Bitvec.toNat v < 2 ^ n
n: โ„•

v: Bitvec n

ZMod.val (toZMod v) = Bitvec.toNat v
Goals accomplished! ๐Ÿ™


def 
ofZMod: {n : โ„•} โ†’ ZMod (2 ^ n) โ†’ Bitvec n
ofZMod {
n: โ„•
n : 
โ„•: Type
โ„•} (
x: ZMod (2 ^ n)
x : 
ZMod: โ„• โ†’ Type
ZMod (
2: ?m.126030
2 ^ 
n: โ„•
n)) : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n := 
  
Bitvec.ofNat: (n : โ„•) โ†’ โ„• โ†’ Bitvec n
Bitvec.ofNat 
_: โ„•
_ 
x: ZMod (2 ^ n)
x.
val: {n : โ„•} โ†’ ZMod n โ†’ โ„•
val

theorem 
toZMod_ofZMod: โˆ€ {n : โ„•} (i : ZMod (2 ^ n)), toZMod (ofZMod i) = i
toZMod_ofZMod {
n: ?m.126187
n} (
i: ZMod (2 ^ n)
i : 
ZMod: โ„• โ†’ Type
ZMod <| 
2: ?m.126194
2 ^ 
n: ?m.126187
n) : (
ofZMod: {n : โ„•} โ†’ ZMod (2 ^ n) โ†’ Bitvec n
ofZMod 
i: ZMod (2 ^ n)
i).
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod = 
i: ZMod (2 ^ n)
i :=
  
ZMod.val_injective: โˆ€ (n : โ„•) [inst : NeZero n], Function.Injective ZMod.val
ZMod.val_injective 
_: โ„•
_ (
Goals accomplished! ๐Ÿ™
n: โ„•

i: ZMod (2 ^ n)

ZMod.val (toZMod (ofZMod i)) = ZMod.val i
Goals accomplished! ๐Ÿ™
)

theorem 
ofZMod_toZMod: โˆ€ {n : โ„•} (v : Bitvec n), ofZMod (toZMod v) = v
ofZMod_toZMod {
n: โ„•
n} (
v: Bitvec n
v : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.126586
n) : 
ofZMod: {n : โ„•} โ†’ ZMod (2 ^ n) โ†’ Bitvec n
ofZMod (
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod 
v: Bitvec n
v) = 
v: Bitvec n
v := 
Goals accomplished! ๐Ÿ™
n: โ„•

v: Bitvec n

ofZMod (toZMod v) = v
n: โ„•

v: Bitvec n

Bitvec.ofNat n (ZMod.val (toZMod v)) = v
n: โ„•

v: Bitvec n

ofZMod (toZMod v) = v
n: โ„•

v: Bitvec n

Bitvec.ofNat n (ZMod.val (toZMod v)) = v
n: โ„•

v: Bitvec n

Bitvec.ofNat n (Bitvec.toNat v) = v
n: โ„•

v: Bitvec n

Bitvec.ofNat n (ZMod.val (toZMod v)) = v
n: โ„•

v: Bitvec n

v = v
Goals accomplished! ๐Ÿ™


theorem 
foldl_addLsb_add: โˆ€ (n k : โ„•) (x : List Bool), List.foldl addLsb (n + k) x = 2 ^ List.length x * k + List.foldl addLsb n x
foldl_addLsb_add : โˆ€ (
n: โ„•
n 
k: โ„•
k : 
โ„•: Type
โ„•) (
x: List Bool
x : 
List: Type ?u.126669 โ†’ Type ?u.126669
List 
Bool: Type
Bool), 
    
x: List Bool
x.
foldl: {ฮฑ : Type ?u.126674} โ†’ {ฮฒ : Type ?u.126673} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb (
n: โ„•
n + 
k: โ„•
k) = 
2: ?m.126739
2 ^ 
x: List Bool
x.
length: {ฮฑ : Type ?u.126748} โ†’ List ฮฑ โ†’ โ„•
length * 
k: โ„•
k + 
x: List Bool
x.
foldl: {ฮฑ : Type ?u.126753} โ†’ {ฮฒ : Type ?u.126752} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
n: โ„•
n
  | 
n: โ„•
n, 
k: โ„•
k, [] => 
Goals accomplished! ๐Ÿ™
n, k: โ„•

List.foldl addLsb (n + k) [] = 2 ^ List.length [] * k + List.foldl addLsb n []
Goals accomplished! ๐Ÿ™

  | 
n: โ„•
n, 
k: โ„•
k, 
a: Bool
a::
l: List Bool
l => 
Goals accomplished! ๐Ÿ™
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k) (a :: l) = 2 ^ List.length (a :: l) * k + List.foldl addLsb n (a :: l)
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k) (a :: l) = 2 ^ List.length (a :: l) * k + List.foldl addLsb n (a :: l)
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (addLsb (n + k) a) l = 2 ^ List.length (a :: l) * k + List.foldl addLsb n (a :: l)
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k) (a :: l) = 2 ^ List.length (a :: l) * k + List.foldl addLsb n (a :: l)
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (addLsb (n + k) a) l = 2 ^ List.length (a :: l) * k + List.foldl addLsb (addLsb n a) l
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k) (a :: l) = 2 ^ List.length (a :: l) * k + List.foldl addLsb n (a :: l)
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k + (n + k) + bif a then 1 else 0) l =   2 ^ List.length (a :: l) * k + List.foldl addLsb (addLsb n a) l
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k) (a :: l) = 2 ^ List.length (a :: l) * k + List.foldl addLsb n (a :: l)
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k + (n + k) + bif a then 1 else 0) l =   2 ^ List.length (a :: l) * k + List.foldl addLsb (n + n + bif a then 1 else 0) l
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k + (n + k) + bif a then 1 else 0) l =   2 ^ List.length (a :: l) * k + List.foldl addLsb (n + n + bif a then 1 else 0) l
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k) (a :: l) = 2 ^ List.length (a :: l) * k + List.foldl addLsb n (a :: l)
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k + (n + k) + bif a then 1 else 0) l =   2 ^ List.length (a :: l) * k + List.foldl addLsb (n + n + bif a then 1 else 0) l
Goals accomplished! ๐Ÿ™
n, k: โ„•

a: Bool

l: List Bool

(n + k + (n + k) + bif a then 1 else 0) = (n + n + bif a then 1 else 0) + (k + k)
Goals accomplished! ๐Ÿ™
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k) (a :: l) = 2 ^ List.length (a :: l) * k + List.foldl addLsb n (a :: l)
n, k: โ„•

a: Bool

l: List Bool

this: (n + k + (n + k) + bif a then 1 else 0) = (n + n + bif a then 1 else 0) + (k + k)

List.foldl addLsb (n + k + (n + k) + bif a then 1 else 0) l =   2 ^ List.length (a :: l) * k + List.foldl addLsb (n + n + bif a then 1 else 0) l
n, k: โ„•

a: Bool

l: List Bool

this: (n + k + (n + k) + bif a then 1 else 0) = (n + n + bif a then 1 else 0) + (k + k)

List.foldl addLsb ((n + n + bif a then 1 else 0) + (k + k)) l =   2 ^ List.length (a :: l) * k + List.foldl addLsb (n + n + bif a then 1 else 0) l
n, k: โ„•

a: Bool

l: List Bool

this: (n + k + (n + k) + bif a then 1 else 0) = (n + n + bif a then 1 else 0) + (k + k)

List.foldl addLsb (n + k + (n + k) + bif a then 1 else 0) l =   2 ^ List.length (a :: l) * k + List.foldl addLsb (n + n + bif a then 1 else 0) l
n, k: โ„•

a: Bool

l: List Bool

this: (n + k + (n + k) + bif a then 1 else 0) = (n + n + bif a then 1 else 0) + (k + k)

2 ^ List.length l * (k + k) + List.foldl addLsb (n + n + bif a then 1 else 0) l =   2 ^ List.length (a :: l) * k + List.foldl addLsb (n + n + bif a then 1 else 0) l
n, k: โ„•

a: Bool

l: List Bool

this: (n + k + (n + k) + bif a then 1 else 0) = (n + n + bif a then 1 else 0) + (k + k)

2 ^ List.length l * (k + k) + List.foldl addLsb (n + n + bif a then 1 else 0) l =   2 ^ List.length (a :: l) * k + List.foldl addLsb (n + n + bif a then 1 else 0) l
n, k: โ„•

a: Bool

l: List Bool

List.foldl addLsb (n + k) (a :: l) = 2 ^ List.length (a :: l) * k + List.foldl addLsb n (a :: l)
Goals accomplished! ๐Ÿ™


theorem 
foldl_addLsb_eq_add_foldl_addLsb_zero: โˆ€ (x : List Bool) (k : โ„•), List.foldl addLsb k x = 2 ^ List.length x * k + List.foldl addLsb 0 x
foldl_addLsb_eq_add_foldl_addLsb_zero (
x: List Bool
x : 
List: Type ?u.129367 โ†’ Type ?u.129367
List 
Bool: Type
Bool) (
k: โ„•
k : 
โ„•: Type
โ„•) :
    
x: List Bool
x.
foldl: {ฮฑ : Type ?u.129374} โ†’ {ฮฒ : Type ?u.129373} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
k: โ„•
k = 
2: ?m.129399
2 ^ 
x: List Bool
x.
length: {ฮฑ : Type ?u.129408} โ†’ List ฮฑ โ†’ โ„•
length * 
k: โ„•
k + 
x: List Bool
x.
foldl: {ฮฑ : Type ?u.129413} โ†’ {ฮฒ : Type ?u.129412} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
0: ?m.129428
0 := 
Goals accomplished! ๐Ÿ™
x: List Bool

k: โ„•

List.foldl addLsb k x = 2 ^ List.length x * k + List.foldl addLsb 0 x
x: List Bool

k: โ„•

List.foldl addLsb k x = 2 ^ List.length x * k + List.foldl addLsb 0 x
x: List Bool

k: โ„•

List.foldl addLsb k x = List.foldl addLsb (0 + k) x
x: List Bool

k: โ„•

List.foldl addLsb k x = 2 ^ List.length x * k + List.foldl addLsb 0 x
x: List Bool

k: โ„•

List.foldl addLsb k x = List.foldl addLsb k x
Goals accomplished! ๐Ÿ™


theorem 
foldl_addLsb_cons_zero: โˆ€ (a : Bool) (x : List Bool),
  List.foldl addLsb 0 (a :: x) = (2 ^ List.length x * bif a then 1 else 0) + List.foldl addLsb 0 x
foldl_addLsb_cons_zero (
a: Bool
a : 
Bool: Type
Bool) (
x: List Bool
x : 
List: Type ?u.129720 โ†’ Type ?u.129720
List 
Bool: Type
Bool) :
    (
a: Bool
a::
x: List Bool
x).
foldl: {ฮฑ : Type ?u.129728} โ†’ {ฮฒ : Type ?u.129727} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
0: ?m.129743
0 = 
2: ?m.129763
2^
x: List Bool
x.
length: {ฮฑ : Type ?u.129772} โ†’ List ฮฑ โ†’ โ„•
length * 
cond: {ฮฑ : Type ?u.129776} โ†’ Bool โ†’ ฮฑ โ†’ ฮฑ โ†’ ฮฑ
cond 
a: Bool
a 
1: ?m.129779
1 
0: ?m.129789
0 + 
x: List Bool
x.
foldl: {ฮฑ : Type ?u.129797} โ†’ {ฮฒ : Type ?u.129796} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
0: ?m.129812
0 :=
  calc (
a: Bool
a::
x: List Bool
x).
foldl: {ฮฑ : Type ?u.129965} โ†’ {ฮฒ : Type ?u.129964} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
0: ?m.129980
0
     = 
x: List Bool
x.
foldl: {ฮฑ : Type ?u.129983} โ†’ {ฮฒ : Type ?u.129982} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb (
0: ?m.130004
0 + 
0: ?m.130015
0 + 
cond: {ฮฑ : Type ?u.130025} โ†’ Bool โ†’ ฮฑ โ†’ ฮฑ โ†’ ฮฑ
cond 
a: Bool
a 
1: ?m.130028
1 
0: ?m.130038
0) := 
rfl: โˆ€ {ฮฑ : Sort ?u.130108} {a : ฮฑ}, a = a
rfl
   
_: ?mโœ
_ = 
_: ?m.130163
_ := 
Goals accomplished! ๐Ÿ™
a: Bool

x: List Bool

List.foldl addLsb (0 + 0 + bif a then 1 else 0) x = (2 ^ List.length x * bif a then 1 else 0) + List.foldl addLsb 0 x
a: Bool

x: List Bool

List.foldl addLsb (0 + 0 + bif a then 1 else 0) x = (2 ^ List.length x * bif a then 1 else 0) + List.foldl addLsb 0 x
a: Bool

x: List Bool

(2 ^ List.length x * bif a then 1 else 0) + List.foldl addLsb (0 + 0) x =   (2 ^ List.length x * bif a then 1 else 0) + List.foldl addLsb 0 x
Goals accomplished! ๐Ÿ™


theorem 
toNat_adc_aux: โˆ€ {x y : List Bool},
  List.length x = List.length y โ†’
    List.foldl addLsb (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false).fst)
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false).snd =       List.foldl addLsb 0 x + List.foldl addLsb 0 y
toNat_adc_aux : โˆ€ {
x: List Bool
x 
y: List Bool
y: 
List: Type ?u.130269 โ†’ Type ?u.130269
List 
Bool: Type
Bool} (
_h: List.length x = List.length y
_h : 
List.length: {ฮฑ : Type ?u.130276} โ†’ List ฮฑ โ†’ โ„•
List.length 
x: List Bool
x = 
List.length: {ฮฑ : Type ?u.130280} โ†’ List ฮฑ โ†’ โ„•
List.length 
y: List Bool
y),
    
List.foldl: {ฮฑ : Type ?u.130288} โ†’ {ฮฒ : Type ?u.130287} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
List.foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb (
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
0: ?m.130298
0 (
List.mapAccumrโ‚‚: {ฯ† : Type ?u.130311} โ†’
  {ฯƒ : Type ?u.130310} โ†’
    {ฮฑ : Type ?u.130309} โ†’ {ฮฒ : Type ?u.130308} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฯƒ โ†’ ฯƒ ร— ฯ†) โ†’ List ฮฑ โ†’ List ฮฒ โ†’ ฯƒ โ†’ ฯƒ ร— List ฯ†
List.mapAccumrโ‚‚ (fun 
x: ?m.130317
x 
y: ?m.130320
y 
c: ?m.130323
c => (
Bitvec.carry: Bool โ†’ Bool โ†’ Bool โ†’ Bool
Bitvec.carry 
x: ?m.130317
x 
y: ?m.130320
y 
c: ?m.130323
c, 
Bitvec.xor3: Bool โ†’ Bool โ†’ Bool โ†’ Bool
Bitvec.xor3 
x: ?m.130317
x 
y: ?m.130320
y 
c: ?m.130323
c)) 
x: List Bool
x 
y: List Bool
y 
false: Bool
false).
fst: {ฮฑ : Type ?u.130342} โ†’ {ฮฒ : Type ?u.130341} โ†’ ฮฑ ร— ฮฒ โ†’ ฮฑ
fst)
      (
List.mapAccumrโ‚‚: {ฯ† : Type ?u.130348} โ†’
  {ฯƒ : Type ?u.130347} โ†’
    {ฮฑ : Type ?u.130346} โ†’ {ฮฒ : Type ?u.130345} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฯƒ โ†’ ฯƒ ร— ฯ†) โ†’ List ฮฑ โ†’ List ฮฒ โ†’ ฯƒ โ†’ ฯƒ ร— List ฯ†
List.mapAccumrโ‚‚ (fun 
x: ?m.130354
x 
y: ?m.130357
y 
c: ?m.130360
c => (
Bitvec.carry: Bool โ†’ Bool โ†’ Bool โ†’ Bool
Bitvec.carry 
x: ?m.130354
x 
y: ?m.130357
y 
c: ?m.130360
c, 
Bitvec.xor3: Bool โ†’ Bool โ†’ Bool โ†’ Bool
Bitvec.xor3 
x: ?m.130354
x 
y: ?m.130357
y 
c: ?m.130360
c)) 
x: List Bool
x 
y: List Bool
y 
false: Bool
false).
snd: {ฮฑ : Type ?u.130377} โ†’ {ฮฒ : Type ?u.130376} โ†’ ฮฑ ร— ฮฒ โ†’ ฮฒ
snd =
    
List.foldl: {ฮฑ : Type ?u.130384} โ†’ {ฮฒ : Type ?u.130383} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
List.foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
0: ?m.130394
0 
x: List Bool
x + 
List.foldl: {ฮฑ : Type ?u.130397} โ†’ {ฮฒ : Type ?u.130396} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
List.foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
0: ?m.130407
0 
y: List Bool
y 
| [], [], _ => 
rfl: โˆ€ {ฮฑ : Sort ?u.130492} {a : ฮฑ}, a = a
rfl
| 
a: Bool
a::
x: List Bool
x, 
b: Bool
b::
y: List Bool
y, 
h: List.length (a :: x) = List.length (b :: y)
h => 
Goals accomplished! ๐Ÿ™
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length (a :: x) = List.length (b :: y)

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   List.foldl addLsb 0 (a :: x) + List.foldl addLsb 0 (b :: y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   List.foldl addLsb 0 (a :: x) + List.foldl addLsb 0 (b :: y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length (a :: x) = List.length (b :: y)

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   List.foldl addLsb 0 (a :: x) + List.foldl addLsb 0 (b :: y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   List.foldl addLsb 0 (a :: x) + List.foldl addLsb 0 (b :: y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   (2 ^ List.length x * bif a then 1 else 0) + List.foldl addLsb 0 x + List.foldl addLsb 0 (b :: y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   List.foldl addLsb 0 (a :: x) + List.foldl addLsb 0 (b :: y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   (2 ^ List.length x * bif a then 1 else 0) + List.foldl addLsb 0 x +     ((2 ^ List.length y * bif b then 1 else 0) + List.foldl addLsb 0 y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   List.foldl addLsb 0 (a :: x) + List.foldl addLsb 0 (b :: y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (List.foldl addLsb 0 x + List.foldl addLsb 0 y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   List.foldl addLsb 0 (a :: x) + List.foldl addLsb 0 (b :: y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     List.foldl addLsb (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false).fst)
      (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false).snd
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   List.foldl addLsb 0 (a :: x) + List.foldl addLsb 0 (b :: y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0
      (let r := List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false;
        let q := (Bitvec.carry a b r.fst, Bitvec.xor3 a b r.fst);
        (q.fst, q.snd :: r.snd)).fst)
    (let r := List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false;
      let q := (Bitvec.carry a b r.fst, Bitvec.xor3 a b r.fst);
      (q.fst, q.snd :: r.snd)).snd =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     List.foldl addLsb (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false).fst)
      (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false).snd
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0
      (let r := List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false;
        let q := (Bitvec.carry a b r.fst, Bitvec.xor3 a b r.fst);
        (q.fst, q.snd :: r.snd)).fst)
    (let r := List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false;
      let q := (Bitvec.carry a b r.fst, Bitvec.xor3 a b r.fst);
      (q.fst, q.snd :: r.snd)).snd =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     List.foldl addLsb (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false).fst)
      (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false).snd
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length (a :: x) = List.length (b :: y)

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   List.foldl addLsb 0 (a :: x) + List.foldl addLsb 0 (b :: y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0
      (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||         b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst))
    (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::       (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     List.foldl addLsb
      (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst)
      (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length (a :: x) = List.length (b :: y)

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   List.foldl addLsb 0 (a :: x) + List.foldl addLsb 0 (b :: y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0
      (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||         b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst))
    (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::       (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     List.foldl addLsb
      (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst)
      (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     List.foldl addLsb 0
      (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::         (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     List.foldl addLsb
      (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst)
      (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0
      (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||         b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst))
    (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::       (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     List.foldl addLsb
      (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst)
      (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     List.foldl addLsb
      (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst)
      (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

List.foldl addLsb
    (addLsb 0
      (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||         b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst))
    (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::       (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     List.foldl addLsb
      (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst)
      (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length (a :: x) = List.length (b :: y)

List.foldl addLsb
    (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd =   List.foldl addLsb 0 (a :: x) + List.foldl addLsb 0 (b :: y)
x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

false
2 ^         List.length
          (xor (xor false b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (false && b ||             false && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor false b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif false then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

true
2 ^         List.length
          (xor (xor true b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (true && b ||             true && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor true b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif true then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

false
2 ^         List.length
          (xor (xor false b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (false && b ||             false && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor false b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif false then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

true
2 ^         List.length
          (xor (xor true b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (true && b ||             true && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor true b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif true then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

false.false
2 ^         List.length
          (xor (xor false false)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (false && false ||             false && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           false && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor false false)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif false then 1 else 0) + 2 ^ List.length y * bif false then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

false.true
2 ^         List.length
          (xor (xor false true)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (false && true ||             false && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           true && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor false true)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif false then 1 else 0) + 2 ^ List.length y * bif true then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

false.false
2 ^         List.length
          (xor (xor false false)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (false && false ||             false && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           false && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor false false)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif false then 1 else 0) + 2 ^ List.length y * bif false then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

false.true
2 ^         List.length
          (xor (xor false true)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (false && true ||             false && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           true && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor false true)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif false then 1 else 0) + 2 ^ List.length y * bif true then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

true.false
2 ^         List.length
          (xor (xor true false)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (true && false ||             true && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           false && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor true false)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif true then 1 else 0) + 2 ^ List.length y * bif false then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

true.true
2 ^         List.length
          (xor (xor true true)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (true && true ||             true && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           true && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor true true)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif true then 1 else 0) + 2 ^ List.length y * bif true then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
Goals accomplished! ๐Ÿ™
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

false.true
(2 ^ List.length y *       bif (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).fst then 0 else 1) +     ((2 ^ List.length y *         bif (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).fst then 1
        else 0) +       ((2 ^ List.length y *           bif (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).fst then 1
          else 0) +         List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)) =   2 ^ List.length y +     ((2 ^ List.length y *         bif (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).fst then 1
        else 0) +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

true.false
(2 ^ List.length y *       bif (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).fst then 0 else 1) +     ((2 ^ List.length y *         bif (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).fst then 1
        else 0) +       ((2 ^ List.length y *           bif (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).fst then 1
          else 0) +         List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)) =   2 ^ List.length y +     ((2 ^ List.length y *         bif (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).fst then 1
        else 0) +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

true.false.false
(2 ^ List.length y * bif false then 0 else 1) +     ((2 ^ List.length y * bif false then 1 else 0) +       ((2 ^ List.length y * bif false then 1 else 0) +         List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)) =   2 ^ List.length y +     ((2 ^ List.length y * bif false then 1 else 0) +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

true.false.true
(2 ^ List.length y * bif true then 0 else 1) +     ((2 ^ List.length y * bif true then 1 else 0) +       ((2 ^ List.length y * bif true then 1 else 0) +         List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)) =   2 ^ List.length y +     ((2 ^ List.length y * bif true then 1 else 0) +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

false.true.false
(2 ^ List.length y * bif false then 0 else 1) +     ((2 ^ List.length y * bif false then 1 else 0) +       ((2 ^ List.length y * bif false then 1 else 0) +         List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)) =   2 ^ List.length y +     ((2 ^ List.length y * bif false then 1 else 0) +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

false.true.true
(2 ^ List.length y * bif true then 0 else 1) +     ((2 ^ List.length y * bif true then 1 else 0) +       ((2 ^ List.length y * bif true then 1 else 0) +         List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)) =   2 ^ List.length y +     ((2 ^ List.length y * bif true then 1 else 0) +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

true.false.false
(2 ^ List.length y * bif false then 0 else 1) +     ((2 ^ List.length y * bif false then 1 else 0) +       ((2 ^ List.length y * bif false then 1 else 0) +         List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)) =   2 ^ List.length y +     ((2 ^ List.length y * bif false then 1 else 0) +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)
x, y: List Bool

h: List.length x = List.length y

true.false.true
(2 ^ List.length y * bif true then 0 else 1) +     ((2 ^ List.length y * bif true then 1 else 0) +       ((2 ^ List.length y * bif true then 1 else 0) +         List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)) =   2 ^ List.length y +     ((2 ^ List.length y * bif true then 1 else 0) +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor x (xor y c))) x y false).snd)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

2 ^         List.length
          (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) *       addLsb 0
        (a && b || a && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst ||           b && (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst) +     ((2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         bif
            xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst then
          1
        else 0) +       List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd) =   ((2 ^ List.length x * bif a then 1 else 0) + 2 ^ List.length y * bif b then 1 else 0) +     (2 ^ List.length (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd *         addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).fst +       List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (x && y || x && c || y && c, xor (xor x y) c)) x y false).snd)
Goals accomplished! ๐Ÿ™
  

theorem 
toNat_adc: โˆ€ {n : โ„•} {x y : Bitvec n}, Bitvec.toNat (adc x y false) = Bitvec.toNat x + Bitvec.toNat y
toNat_adc {
n: โ„•
n : 
Nat: Type
Nat} {
x: Bitvec n
x 
y: Bitvec n
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n} : (
Bitvec.adc: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Bool โ†’ Bitvec (n + 1)
Bitvec.adc 
x: Bitvec n
x 
y: Bitvec n
y 
false: Bool
false).
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat = 
x: Bitvec n
x.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat + 
y: Bitvec n
y.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat := 
Goals accomplished! ๐Ÿ™
n: โ„•

x, y: Bitvec n

Bitvec.toNat (adc x y false) = Bitvec.toNat x + Bitvec.toNat y
n: โ„•

y: Bitvec n

x: List Bool

hx: List.length x = n

mk
Bitvec.toNat (adc { val := x, property := hx } y false) = Bitvec.toNat { val := x, property := hx } + Bitvec.toNat y
n: โ„•

x, y: Bitvec n

Bitvec.toNat (adc x y false) = Bitvec.toNat x + Bitvec.toNat y
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

mk.mk
Bitvec.toNat (adc { val := x, property := hx } { val := y, property := hy } false) =   Bitvec.toNat { val := x, property := hx } + Bitvec.toNat { val := y, property := hy }
n: โ„•

x, y: Bitvec n

Bitvec.toNat (adc x y false) = Bitvec.toNat x + Bitvec.toNat y
x, y: List Bool

hy: List.length y = List.length x

mk.mk
Bitvec.toNat (adc { val := x, property := (_ : List.length x = List.length x) } { val := y, property := hy } false) =   Bitvec.toNat { val := x, property := (_ : List.length x = List.length x) } + Bitvec.toNat { val := y, property := hy }
n: โ„•

x, y: Bitvec n

Bitvec.toNat (adc x y false) = Bitvec.toNat x + Bitvec.toNat y
x, y: List Bool

hy: List.length y = List.length x

mk.mk
List.foldl addLsb (addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false).fst)
    (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry x y c, Bitvec.xor3 x y c)) x y false).snd =   List.foldl addLsb 0 x + List.foldl addLsb 0 y
n: โ„•

x, y: Bitvec n

Bitvec.toNat (adc x y false) = Bitvec.toNat x + Bitvec.toNat y
Goals accomplished! ๐Ÿ™


theorem 
toNat_tail: โˆ€ {n : โ„•} (x : Bitvec n), Bitvec.toNat (Vector.tail x) = Bitvec.toNat x % 2 ^ (n - 1)
toNat_tail : โˆ€ {
n: โ„•
n : 
Nat: Type
Nat} (
x: Bitvec n
x : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n), 
Bitvec.toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
Bitvec.toNat 
x: Bitvec n
x.
tail: {ฮฑ : Type ?u.143509} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ Vector ฮฑ (n - 1)
tail = 
x: Bitvec n
x.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat % 
2: ?m.143528
2^(
n: โ„•
n-
1: ?m.143541
1)
  | 
0: โ„•
0, โŸจ[], _โŸฉ => 
rfl: โˆ€ {ฮฑ : Sort ?u.143737} {a : ฮฑ}, a = a
rfl
  | 
n: โ„•
n+
1: โ„•
1, โŸจ
a: Bool
a::
l: List Bool
l, 
h: List.length (a :: l) = n + 1
hโŸฉ => 
Goals accomplished! ๐Ÿ™
n: โ„•

a: Bool

l: List Bool

h: List.length (a :: l) = n + 1

Bitvec.toNat (Vector.tail { val := a :: l, property := h }) =   Bitvec.toNat { val := a :: l, property := h } % 2 ^ (n + 1 - 1)
n: โ„•

a: Bool

l: List Bool

h: List.length (a :: l) = n + 1

Bitvec.toNat (Vector.tail { val := a :: l, property := h }) =   Bitvec.toNat { val := a :: l, property := h } % 2 ^ (n + 1 - 1)
n: โ„•

a: Bool

l: List Bool

h: List.length (a :: l) = n + 1

Bitvec.toNat (Vector.tail { val := a :: l, property := h })
n: โ„•

a: Bool

l: List Bool

h: List.length (a :: l) = n + 1

Bitvec.toNat (Vector.tail { val := a :: l, property := h }) % 2 ^ (n + 1 - 1)
n: โ„•

a: Bool

l: List Bool

h: List.length (a :: l) = n + 1

Bitvec.toNat (Vector.tail { val := a :: l, property := h }) % 2 ^ (n + 1 - 1)
n: โ„•

a: Bool

l: List Bool

h: List.length (a :: l) = n + 1

Bitvec.toNat (Vector.tail { val := a :: l, property := h }) =   Bitvec.toNat { val := a :: l, property := h } % 2 ^ (n + 1 - 1)
n: โ„•

a: Bool

l: List Bool

hโœ: List.length (a :: l) = n + 1

h: List.length l = n

Bitvec.toNat (Vector.tail { val := a :: l, property := hโœ }) % 2 ^ (n + 1 - 1) =   Bitvec.toNat { val := a :: l, property := hโœ } % 2 ^ (n + 1 - 1)
n: โ„•

a: Bool

l: List Bool

h: List.length (a :: l) = n + 1

Bitvec.toNat (Vector.tail { val := a :: l, property := h }) =   Bitvec.toNat { val := a :: l, property := h } % 2 ^ (n + 1 - 1)
n: โ„•

a: Bool

l: List Bool

hโœ: List.length (a :: l) = n + 1

h: List.length l = n

List.foldl addLsb 0 โ†‘(Vector.tail { val := a :: l, property := hโœ }) % 2 ^ (n + 1 - 1) =   ((2 ^ n * bif a then 1 else 0) + List.foldl addLsb 0 l) % 2 ^ (n + 1 - 1)
n: โ„•

a: Bool

l: List Bool

h: List.length (a :: l) = n + 1

Bitvec.toNat (Vector.tail { val := a :: l, property := h }) =   Bitvec.toNat { val := a :: l, property := h } % 2 ^ (n + 1 - 1)
n: โ„•

a: Bool

l: List Bool

hโœ: List.length (a :: l) = n + 1

h: List.length l = n

List.foldl addLsb 0 l % 2 ^ n = ((2 ^ n * bif a then 1 else 0) + List.foldl addLsb 0 l) % 2 ^ n
n: โ„•

a: Bool

l: List Bool

h: List.length (a :: l) = n + 1

Bitvec.toNat (Vector.tail { val := a :: l, property := h }) =   Bitvec.toNat { val := a :: l, property := h } % 2 ^ (n + 1 - 1)
n: โ„•

a: Bool

l: List Bool

hโœ: List.length (a :: l) = n + 1

h: List.length l = n

List.foldl addLsb 0 l % 2 ^ n = ((2 ^ n * bif a then 1 else 0) + List.foldl addLsb 0 l) % 2 ^ n
n: โ„•

a: Bool

l: List Bool

hโœ: List.length (a :: l) = n + 1

h: List.length l = n

List.foldl addLsb 0 l % 2 ^ n = ((bif a then 1 else 0) * 2 ^ n + List.foldl addLsb 0 l) % 2 ^ n
n: โ„•

a: Bool

l: List Bool

hโœ: List.length (a :: l) = n + 1

h: List.length l = n

List.foldl addLsb 0 l % 2 ^ n = ((2 ^ n * bif a then 1 else 0) + List.foldl addLsb 0 l) % 2 ^ n
n: โ„•

a: Bool

l: List Bool

hโœ: List.length (a :: l) = n + 1

h: List.length l = n

List.foldl addLsb 0 l % 2 ^ n = List.foldl addLsb 0 l % 2 ^ n
Goals accomplished! ๐Ÿ™


@[simp]
theorem 
toNat_add: โˆ€ {n : โ„•} (x y : Bitvec n), Bitvec.toNat (x + y) = (Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n
toNat_add {
n: โ„•
n : 
Nat: Type
Nat} (
x: Bitvec n
x 
y: Bitvec n
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) : (
x: Bitvec n
x + 
y: Bitvec n
y).
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat = (
x: Bitvec n
x.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat + 
y: Bitvec n
y.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat) % 
2: ?m.146261
2^
n: โ„•
n := 
Goals accomplished! ๐Ÿ™
n: โ„•

x, y: Bitvec n

Bitvec.toNat (x + y) = (Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n
n: โ„•

x, y: Bitvec n

Bitvec.toNat (Vector.tail (adc x y false)) = (Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n
n: โ„•

x, y: Bitvec n

Bitvec.toNat (x + y) = (Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n
n: โ„•

x, y: Bitvec n

Bitvec.toNat (Vector.tail (adc x y false)) = (Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n
n: โ„•

x, y: Bitvec n

Bitvec.toNat (adc x y false) % 2 ^ (n + 1 - 1) = (Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n
n: โ„•

x, y: Bitvec n

Bitvec.toNat (Vector.tail (adc x y false)) = (Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n
n: โ„•

x, y: Bitvec n

(Bitvec.toNat x + Bitvec.toNat y) % 2 ^ (n + 1 - 1) = (Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n
n: โ„•

x, y: Bitvec n

Bitvec.toNat (Vector.tail (adc x y false)) = (Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n
n: โ„•

x, y: Bitvec n

(Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n = (Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n
Goals accomplished! ๐Ÿ™



theorem 
toZMod_add: โˆ€ {n : โ„•} (x y : Bitvec n), toZMod (x + y) = toZMod x + toZMod y
toZMod_add {
n: โ„•
n : 
โ„•: Type
โ„•} (
x: Bitvec n
x 
y: Bitvec n
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) : (
x: Bitvec n
x + 
y: Bitvec n
y).
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod = (
x: Bitvec n
x.
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod + 
y: Bitvec n
y.
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod) := 
Goals accomplished! ๐Ÿ™
n: โ„•

x, y: Bitvec n

toZMod (x + y) = toZMod x + toZMod y
n: โ„•

x, y: Bitvec n

a
ZMod.val (toZMod (x + y)) = ZMod.val (toZMod x + toZMod y)
n: โ„•

x, y: Bitvec n

toZMod (x + y) = toZMod x + toZMod y
n: โ„•

x, y: Bitvec n

a
ZMod.val (toZMod (x + y)) = ZMod.val (toZMod x + toZMod y)
n: โ„•

x, y: Bitvec n

a
Bitvec.toNat (x + y) = ZMod.val (toZMod x + toZMod y)
n: โ„•

x, y: Bitvec n

a
ZMod.val (toZMod (x + y)) = ZMod.val (toZMod x + toZMod y)
n: โ„•

x, y: Bitvec n

a
Bitvec.toNat (x + y) = (ZMod.val (toZMod x) + ZMod.val (toZMod y)) % 2 ^ n
n: โ„•

x, y: Bitvec n

a
ZMod.val (toZMod (x + y)) = ZMod.val (toZMod x + toZMod y)
n: โ„•

x, y: Bitvec n

a
(Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n = (ZMod.val (toZMod x) + ZMod.val (toZMod y)) % 2 ^ n
n: โ„•

x, y: Bitvec n

a
ZMod.val (toZMod (x + y)) = ZMod.val (toZMod x + toZMod y)
n: โ„•

x, y: Bitvec n

a
(Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n = (Bitvec.toNat x + ZMod.val (toZMod y)) % 2 ^ n
n: โ„•

x, y: Bitvec n

a
ZMod.val (toZMod (x + y)) = ZMod.val (toZMod x + toZMod y)
n: โ„•

x, y: Bitvec n

a
(Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n = (Bitvec.toNat x + Bitvec.toNat y) % 2 ^ n
Goals accomplished! ๐Ÿ™


theorem 
ofZMod_add: โˆ€ {n : โ„•} (x y : ZMod (2 ^ n)), ofZMod (x + y) = ofZMod x + ofZMod y
ofZMod_add {
n: โ„•
n : 
โ„•: Type
โ„•} (
x: ZMod (2 ^ n)
x 
y: ZMod (2 ^ n)
y : 
ZMod: โ„• โ†’ Type
ZMod (
2: ?m.147824
2 ^
n: โ„•
n)) : 
    
Bitvec.ofZMod: {n : โ„•} โ†’ ZMod (2 ^ n) โ†’ Bitvec n
Bitvec.ofZMod (
x: ZMod (2 ^ n)
x + 
y: ZMod (2 ^ n)
y) = 
Bitvec.ofZMod: {n : โ„•} โ†’ ZMod (2 ^ n) โ†’ Bitvec n
Bitvec.ofZMod 
x: ZMod (2 ^ n)
x + 
Bitvec.ofZMod: {n : โ„•} โ†’ ZMod (2 ^ n) โ†’ Bitvec n
Bitvec.ofZMod 
y: ZMod (2 ^ n)
y := 
Goals accomplished! ๐Ÿ™
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (x + y) = ofZMod x + ofZMod y
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (x + y) = ofZMod x + ofZMod y
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (toZMod (ofZMod x) + y) = ofZMod (toZMod (ofZMod x)) + ofZMod y
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (x + y) = ofZMod x + ofZMod y
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (toZMod (ofZMod x) + toZMod (ofZMod y)) = ofZMod (toZMod (ofZMod x)) + ofZMod (toZMod (ofZMod y))
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (x + y) = ofZMod x + ofZMod y
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (toZMod (ofZMod x + ofZMod y)) = ofZMod (toZMod (ofZMod x)) + ofZMod (toZMod (ofZMod y))
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (x + y) = ofZMod x + ofZMod y
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (toZMod (ofZMod x + ofZMod y)) = ofZMod x + ofZMod (toZMod (ofZMod y))
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (x + y) = ofZMod x + ofZMod y
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (toZMod (ofZMod x + ofZMod y)) = ofZMod x + ofZMod y
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod (x + y) = ofZMod x + ofZMod y
n: โ„•

x, y: ZMod (2 ^ n)

ofZMod x + ofZMod y = ofZMod x + ofZMod y
Goals accomplished! ๐Ÿ™


theorem 
zero_def: โˆ€ {n : โ„•}, 0 = { val := List.replicate n false, property := (_ : List.length โ†‘0 = n) }
zero_def : (
0: ?m.148306
0 : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.148300
n) = โŸจ
List.replicate: {ฮฑ : Type ?u.148349} โ†’ โ„• โ†’ ฮฑ โ†’ List ฮฑ
List.replicate 
n: ?m.148300
n 
false: Bool
false, (
0: ?m.148354
0 : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.148300
n).
2: โˆ€ {ฮฑ : Sort ?u.148356} {p : ฮฑ โ†’ Prop} (self : Subtype p), p โ†‘self
2โŸฉ  := 
rfl: โˆ€ {ฮฑ : Sort ?u.148377} {a : ฮฑ}, a = a
rfl

theorem 
toList_zero: โˆ€ {n : โ„•}, Vector.toList 0 = List.replicate n false
toList_zero : 
Vector.toList: {ฮฑ : Type ?u.148397} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
Vector.toList (
0: ?m.148402
0 : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.148393
n) = 
List.replicate: {ฮฑ : Type ?u.148431} โ†’ โ„• โ†’ ฮฑ โ†’ List ฮฑ
List.replicate 
n: ?m.148393
n 
false: Bool
false := 
rfl: โˆ€ {ฮฑ : Sort ?u.148437} {a : ฮฑ}, a = a
rfl

@[simp]
theorem 
toNat_zero: โˆ€ {n : โ„•}, Bitvec.toNat 0 = 0
toNat_zero : โˆ€ {
n: โ„•
n : 
Nat: Type
Nat}, (
0: ?m.148469
0 : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n).
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat = 
0: ?m.148501
0
  | 
0: โ„•
0 => 
rfl: โˆ€ {ฮฑ : Sort ?u.148532} {a : ฮฑ}, a = a
rfl
  | 
n: โ„•
n+1 => 
Goals accomplished! ๐Ÿ™
n: โ„•

Bitvec.toNat 0 = 0
Goals accomplished! ๐Ÿ™


theorem 
ofNat_zero: โˆ€ {w : โ„•}, Bitvec.ofNat w 0 = 0
ofNat_zero : 
Bitvec.ofNat: (n : โ„•) โ†’ โ„• โ†’ Bitvec n
Bitvec.ofNat 
w: ?m.149405
w 
0: ?m.149410
0 = 
0: ?m.149421
0 := 
Goals accomplished! ๐Ÿ™
w: โ„•

Bitvec.ofNat w 0 = 0
w: โ„•

Bitvec.ofNat w 0 = 0
w: โ„•

Bitvec.ofNat w (Bitvec.toNat 0) = 0
w: โ„•

โ„•
w: โ„•

Bitvec.ofNat w 0 = 0
w: โ„•

0 = 0
Goals accomplished! ๐Ÿ™


@[simp]
theorem 
toZMod_zero: โˆ€ {n : โ„•}, toZMod 0 = 0
toZMod_zero : โˆ€ {
n: โ„•
n : 
Nat: Type
Nat}, (
0: ?m.149495
0 : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n).
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod = 
0: ?m.149543
0 := 
  
Goals accomplished! ๐Ÿ™
โˆ€ {n : โ„•}, toZMod 0 = 0
Goals accomplished! ๐Ÿ™


@[simp]
theorem 
ofZMod_zero: โˆ€ {n : โ„•}, ofZMod 0 = 0
ofZMod_zero : 
Bitvec.ofZMod: {n : โ„•} โ†’ ZMod (2 ^ n) โ†’ Bitvec n
Bitvec.ofZMod (
0: ?m.151469
0 : 
ZMod: โ„• โ†’ Type
ZMod (
2: ?m.151397
2^
n: ?m.151387
n)) = 
0: ?m.151772
0 := 
Goals accomplished! ๐Ÿ™
n: โ„•

ofZMod 0 = 0
n: โ„•

ofZMod 0 = 0
n: โ„•

ofZMod (toZMod 0) = 0
n: โ„•

ofZMod 0 = 0
n: โ„•

0 = 0
Goals accomplished! ๐Ÿ™


theorem 
toList_one: โˆ€ {n : โ„•}, Vector.toList 1 = List.replicate n false ++ [true]
toList_one {
n: โ„•
n : 
โ„•: Type
โ„•} : (
1: ?m.151950
1 : 
Bitvec: โ„• โ†’ Type
Bitvec (
n: โ„•
n + 
1: ?m.151889
1)).
toList: {ฮฑ : Type ?u.151974} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList = 
List.replicate: {ฮฑ : Type ?u.151985} โ†’ โ„• โ†’ ฮฑ โ†’ List ฮฑ
List.replicate 
n: โ„•
n 
false: Bool
false ++ [
true: Bool
true] := 
rfl: โˆ€ {ฮฑ : Sort ?u.152031} {a : ฮฑ}, a = a
rfl 

theorem 
toNat_one: โˆ€ {n : โ„•}, Bitvec.toNat 1 = if n = 0 then 0 else 1
toNat_one : โˆ€ {
n: โ„•
n : 
Nat: Type
Nat}, (
1: ?m.152107
1 : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n).
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat = if 
n: โ„•
n = 
0: ?m.152140
0 then 
0: ?m.152165
0 else 
1: ?m.152176
1
  | 
0: โ„•
0 => 
rfl: โˆ€ {ฮฑ : Sort ?u.152219} {a : ฮฑ}, a = a
rfl
  | 
1: โ„•
1 => 
rfl: โˆ€ {ฮฑ : Sort ?u.152270} {a : ฮฑ}, a = a
rfl
  | 
n: โ„•
n+2 => 
Goals accomplished! ๐Ÿ™
n: โ„•

Bitvec.toNat 1 = if n + 2 = 0 then 0 else 1
n: โ„•

this: Bitvec.toNat 1 = if n + 1 = 0 then 0 else 1

Bitvec.toNat 1 = if n + 2 = 0 then 0 else 1
n: โ„•

Bitvec.toNat 1 = if n + 2 = 0 then 0 else 1
n: โ„•

this: addLsb (List.foldl addLsb 0 (List.replicate n false)) true = 1

addLsb (List.foldl addLsb (addLsb 0 false) (List.replicate n false)) true = 1
n: โ„•

Bitvec.toNat 1 = if n + 2 = 0 then 0 else 1
n: โ„•

this: List.foldl addLsb 0 (List.replicate n false) = 0

addLsb (List.foldl addLsb (addLsb 0 false) (List.replicate n false)) true = 1
n: โ„•

Bitvec.toNat 1 = if n + 2 = 0 then 0 else 1
n: โ„•

this: List.foldl addLsb 0 (List.replicate n false) = 0

addLsb (List.foldl addLsb (addLsb 0 false) (List.replicate n false)) true = 1
n: โ„•

this: List.foldl addLsb 0 (List.replicate n false) = 0

addLsb (2 ^ List.length (List.replicate n false) * addLsb 0 false + List.foldl addLsb 0 (List.replicate n false)) true =   1
n: โ„•

this: List.foldl addLsb 0 (List.replicate n false) = 0

addLsb (List.foldl addLsb (addLsb 0 false) (List.replicate n false)) true = 1
n: โ„•

this: List.foldl addLsb 0 (List.replicate n false) = 0

addLsb (2 ^ List.length (List.replicate n false) * addLsb 0 false + 0) true = 1
n: โ„•

this: List.foldl addLsb 0 (List.replicate n false) = 0

addLsb (2 ^ List.length (List.replicate n false) * addLsb 0 false + 0) true = 1
n: โ„•

Bitvec.toNat 1 = if n + 2 = 0 then 0 else 1
Goals accomplished! ๐Ÿ™


@[simp]
theorem 
toZMod_one: โˆ€ {n : โ„•}, toZMod 1 = 1
toZMod_one : โˆ€ {
n: โ„•
n : 
Nat: Type
Nat}, (
1: ?m.155261
1 : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n).
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod = 
1: ?m.155309
1 := 
Goals accomplished! ๐Ÿ™
โˆ€ {n : โ„•}, toZMod 1 = 1
Goals accomplished! ๐Ÿ™


@[simp]
theorem 
ofZMod_one: โˆ€ {n : โ„•}, ofZMod 1 = 1
ofZMod_one : 
Bitvec.ofZMod: {n : โ„•} โ†’ ZMod (2 ^ n) โ†’ Bitvec n
Bitvec.ofZMod (
1: ?m.159415
1 : 
ZMod: โ„• โ†’ Type
ZMod (
2: ?m.159343
2^
n: ?m.159333
n)) = 
1: ?m.159628
1 := 
Goals accomplished! ๐Ÿ™
n: โ„•

ofZMod 1 = 1
n: โ„•

ofZMod 1 = 1
n: โ„•

ofZMod (toZMod 1) = 1
n: โ„•

ofZMod 1 = 1
n: โ„•

1 = 1
Goals accomplished! ๐Ÿ™



instance: {n : โ„•} โ†’ SMul โ„• (Bitvec n)
instance : 
SMul: Type ?u.159744 โ†’ Type ?u.159743 โ†’ Type (max?u.159744?u.159743)
SMul 
โ„•: Type
โ„• (
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.159740
n) := โŸจ
nsmulRec: {M : Type ?u.159756} โ†’ [inst : Zero M] โ†’ [inst : Add M] โ†’ โ„• โ†’ M โ†’ M
nsmulRecโŸฉ

theorem 
nsmul_def: โˆ€ {n : โ„•} (x : Bitvec n) (y : โ„•), y โ€ข x = nsmulRec y x
nsmul_def {
n: โ„•
n : 
โ„•: Type
โ„•} (
x: Bitvec n
x : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) (
y: โ„•
y : 
โ„•: Type
โ„•) : 
y: โ„•
y โ€ข 
x: Bitvec n
x = 
nsmulRec: {M : Type ?u.160071} โ†’ [inst : Zero M] โ†’ [inst : Add M] โ†’ โ„• โ†’ M โ†’ M
nsmulRec 
y: โ„•
y 
x: Bitvec n
x := 
rfl: โˆ€ {ฮฑ : Sort ?u.160103} {a : ฮฑ}, a = a
rfl

@[simp]
theorem 
toZMod_nsmul: โˆ€ {n : โ„•} (x : Bitvec n) (y : โ„•), toZMod (y โ€ข x) = y โ€ข toZMod x
toZMod_nsmul {
n: โ„•
n : 
โ„•: Type
โ„•} (
x: Bitvec n
x : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) (
y: โ„•
y : 
โ„•: Type
โ„•) : (
y: โ„•
y โ€ข 
x: Bitvec n
x).
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod = 
y: โ„•
y โ€ข 
x: Bitvec n
x.
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod := 
Goals accomplished! ๐Ÿ™
n: โ„•

x: Bitvec n

y: โ„•

toZMod (y โ€ข x) = y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

toZMod (y โ€ข x) = y โ€ข toZMod x
n: โ„•

x: Bitvec n

zero
toZMod (Nat.zero โ€ข x) = Nat.zero โ€ข toZMod x
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™
n: โ„•

x: Bitvec n

y: โ„•

toZMod (y โ€ข x) = y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod (Nat.succ y โ€ข x) = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod (Nat.succ y โ€ข x) = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod (nsmulRec (Nat.succ y) x) = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod (Nat.succ y โ€ข x) = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod (x + nsmulRec y x) = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod (Nat.succ y โ€ข x) = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod x + toZMod (nsmulRec y x) = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod (Nat.succ y โ€ข x) = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod x + toZMod (y โ€ข x) = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod (Nat.succ y โ€ข x) = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod x + y โ€ข toZMod x = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod x + y โ€ข toZMod x = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod x + y โ€ข toZMod x = Nat.succ y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ih: toZMod (y โ€ข x) = y โ€ข toZMod x

succ
toZMod (Nat.succ y โ€ข x) = Nat.succ y โ€ข toZMod x
Goals accomplished! ๐Ÿ™


theorem 
toInt_sub_aux: โˆ€ {x y : List Bool},
  List.length x = List.length y โ†’
    (โ†‘(List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).snd) -         2 ^ List.length x *           bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).fst then 1 else 0) =       โ†‘(List.foldl addLsb 0 x) + -โ†‘(List.foldl addLsb 0 y)
toInt_sub_aux : โˆ€ {
x: List Bool
x 
y: List Bool
y : 
List: Type ?u.164588 โ†’ Type ?u.164588
List 
Bool: Type
Bool} (
_hx: List.length x = List.length y
_hx : 
List.length: {ฮฑ : Type ?u.164595} โ†’ List ฮฑ โ†’ โ„•
List.length 
x: List Bool
x = 
List.length: {ฮฑ : Type ?u.164599} โ†’ List ฮฑ โ†’ โ„•
List.length 
y: List Bool
y),
    (โ†‘(
List.foldl: {ฮฑ : Type ?u.164611} โ†’ {ฮฒ : Type ?u.164610} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
List.foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
0: ?m.164621
0 (
List.mapAccumrโ‚‚: {ฯ† : Type ?u.164634} โ†’
  {ฯƒ : Type ?u.164633} โ†’
    {ฮฑ : Type ?u.164632} โ†’ {ฮฒ : Type ?u.164631} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฯƒ โ†’ ฯƒ ร— ฯ†) โ†’ List ฮฑ โ†’ List ฮฒ โ†’ ฯƒ โ†’ ฯƒ ร— List ฯ†
List.mapAccumrโ‚‚ (fun 
x: ?m.164640
x 
y: ?m.164643
y 
c: ?m.164646
c => (
Bitvec.carry: Bool โ†’ Bool โ†’ Bool โ†’ Bool
Bitvec.carry (!
x: ?m.164640
x) 
y: ?m.164643
y 
c: ?m.164646
c, 
Bitvec.xor3: Bool โ†’ Bool โ†’ Bool โ†’ Bool
Bitvec.xor3 
x: ?m.164640
x 
y: ?m.164643
y 
c: ?m.164646
c)) 
x: List Bool
x 
y: List Bool
y 
false: Bool
false).
snd: {ฮฑ : Type ?u.164665} โ†’ {ฮฒ : Type ?u.164664} โ†’ ฮฑ ร— ฮฒ โ†’ ฮฒ
snd) : 
โ„ค: Type
โ„ค)
    - 
2: ?m.164725
2 ^ 
x: List Bool
x.
length: {ฮฑ : Type ?u.164734} โ†’ List ฮฑ โ†’ โ„•
length * 
cond: {ฮฑ : Type ?u.164738} โ†’ Bool โ†’ ฮฑ โ†’ ฮฑ โ†’ ฮฑ
cond (
List.mapAccumrโ‚‚: {ฯ† : Type ?u.164743} โ†’
  {ฯƒ : Type ?u.164742} โ†’
    {ฮฑ : Type ?u.164741} โ†’ {ฮฒ : Type ?u.164740} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฯƒ โ†’ ฯƒ ร— ฯ†) โ†’ List ฮฑ โ†’ List ฮฒ โ†’ ฯƒ โ†’ ฯƒ ร— List ฯ†
List.mapAccumrโ‚‚ (fun 
x: ?m.164749
x 
y: ?m.164752
y 
c: ?m.164755
c => (
Bitvec.carry: Bool โ†’ Bool โ†’ Bool โ†’ Bool
Bitvec.carry (!
x: ?m.164749
x) 
y: ?m.164752
y 
c: ?m.164755
c, 
Bitvec.xor3: Bool โ†’ Bool โ†’ Bool โ†’ Bool
Bitvec.xor3 
x: ?m.164749
x 
y: ?m.164752
y 
c: ?m.164755
c)) 
x: List Bool
x 
y: List Bool
y 
false: Bool
false).
fst: {ฮฑ : Type ?u.164772} โ†’ {ฮฒ : Type ?u.164771} โ†’ ฮฑ ร— ฮฒ โ†’ ฮฑ
fst 
1: ?m.164776
1 
0: ?m.164786
0 =
  โ†‘(
List.foldl: {ฮฑ : Type ?u.165130} โ†’ {ฮฒ : Type ?u.165129} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
List.foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
0: ?m.165140
0 
x: List Bool
x) + -โ†‘(
List.foldl: {ฮฑ : Type ?u.165174} โ†’ {ฮฒ : Type ?u.165173} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
List.foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
0: ?m.165184
0 
y: List Bool
y) 
| [], [], _ => 
rfl: โˆ€ {ฮฑ : Sort ?u.165602} {a : ฮฑ}, a = a
rfl
|  
a: Bool
a::
x: List Bool
x, 
b: Bool
b::
y: List Bool
y, 
h: List.length (a :: x) = List.length (b :: y)
h => 
Goals accomplished! ๐Ÿ™
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length (a :: x) = List.length (b :: y)

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length (a :: x) = List.length (b :: y)

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘((2 ^ List.length x * bif a then 1 else 0) + List.foldl addLsb 0 x) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘((2 ^ List.length x * bif a then 1 else 0) + List.foldl addLsb 0 x) +     -โ†‘((2 ^ List.length y * bif b then 1 else 0) + List.foldl addLsb 0 y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + โ†‘(List.foldl addLsb 0 x) +     -โ†‘((2 ^ List.length y * bif b then 1 else 0) + List.foldl addLsb 0 y)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + โ†‘(List.foldl addLsb 0 x) +     -(โ†‘(2 ^ List.length y * bif b then 1 else 0) + โ†‘(List.foldl addLsb 0 y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + โ†‘(List.foldl addLsb 0 x) +     (-โ†‘(2 ^ List.length y * bif b then 1 else 0) + -โ†‘(List.foldl addLsb 0 y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0 x) + -โ†‘(List.foldl addLsb 0 y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).fst then 1 else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (let r := List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false;
          let q := (Bitvec.carry (!a) b r.fst, Bitvec.xor3 a b r.fst);
          (q.fst, q.snd :: r.snd)).snd) -     2 ^ List.length (a :: x) *       bif
          (let r := List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false;
            let q := (Bitvec.carry (!a) b r.fst, Bitvec.xor3 a b r.fst);
            (q.fst, q.snd :: r.snd)).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).fst then 1 else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (let r := List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false;
          let q := (Bitvec.carry (!a) b r.fst, Bitvec.xor3 a b r.fst);
          (q.fst, q.snd :: r.snd)).snd) -     2 ^ List.length (a :: x) *       bif
          (let r := List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false;
            let q := (Bitvec.carry (!a) b r.fst, Bitvec.xor3 a b r.fst);
            (q.fst, q.snd :: r.snd)).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).fst then 1 else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length (a :: x) = List.length (b :: y)

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::           (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length (a :: x) = List.length (b :: y)

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::           (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         List.foldl addLsb 0
          (xor (xor a b)
              (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::             (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(List.foldl addLsb 0
        (xor (xor a b) (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::           (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length (a :: x) = List.length (b :: y)

(โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).snd) -     2 ^ List.length (a :: x) *       bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) (a :: x) (b :: y) false).fst then 1
      else 0) =   โ†‘(List.foldl addLsb 0 (a :: x)) + -โ†‘(List.foldl addLsb 0 (b :: y))
x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

false
(โ†‘(2 ^             List.length
              (xor (xor false b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor false b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (false :: x) *       bif
          !false && b ||               !false &&                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif false then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

true
(โ†‘(2 ^             List.length
              (xor (xor true b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor true b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (true :: x) *       bif
          !true && b ||               !true && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif true then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

false
(โ†‘(2 ^             List.length
              (xor (xor false b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor false b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (false :: x) *       bif
          !false && b ||               !false &&                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif false then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

true
(โ†‘(2 ^             List.length
              (xor (xor true b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor true b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (true :: x) *       bif
          !true && b ||               !true && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif true then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

true.false
(โ†‘(2 ^             List.length
              (xor (xor true false)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor true false)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (true :: x) *       bif
          !true && false ||               !true && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             false && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif true then 1 else 0) + -โ†‘(2 ^ List.length y * bif false then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

true.true
(โ†‘(2 ^             List.length
              (xor (xor true true)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor true true)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (true :: x) *       bif
          !true && true ||               !true && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             true && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif true then 1 else 0) + -โ†‘(2 ^ List.length y * bif true then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

false.false
(โ†‘(2 ^             List.length
              (xor (xor false false)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor false false)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (false :: x) *       bif
          !false && false ||               !false &&                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             false && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif false then 1 else 0) + -โ†‘(2 ^ List.length y * bif false then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

false.true
(โ†‘(2 ^             List.length
              (xor (xor false true)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor false true)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (false :: x) *       bif
          !false && true ||               !false &&                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             true && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif false then 1 else 0) + -โ†‘(2 ^ List.length y * bif true then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

true.false
(โ†‘(2 ^             List.length
              (xor (xor true false)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor true false)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (true :: x) *       bif
          !true && false ||               !true && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             false && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif true then 1 else 0) + -โ†‘(2 ^ List.length y * bif false then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

true.true
(โ†‘(2 ^             List.length
              (xor (xor true true)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor true true)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (true :: x) *       bif
          !true && true ||               !true && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             true && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif true then 1 else 0) + -โ†‘(2 ^ List.length y * bif true then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

false.true
-(2 ^ List.length y + 2 ^ List.length y) +     (โ†‘2 ^ List.length y *         โ†‘(bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 0
          else 1) +       โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd)) =   -โ†‘2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +       -(2 ^ List.length y *           bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
          else 0))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

false.false
โ†‘2 ^ List.length y *       โ†‘(bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
        else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +       -((2 ^ List.length y *             bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
            else 0) +           2 ^ List.length y *             bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
            else 0)) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +     -(2 ^ List.length y *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

false.true
-(2 ^ List.length y + 2 ^ List.length y) +     (โ†‘2 ^ List.length y *         โ†‘(bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 0
          else 1) +       โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd)) =   -โ†‘2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +       -(2 ^ List.length y *           bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
          else 0))
x, y: List Bool

h: List.length x = List.length y

true.false
โ†‘2 ^ List.length y *       โ†‘(bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 0
        else 1) +     โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) =   โ†‘2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +       -(2 ^ List.length y *           bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
          else 0))
x, y: List Bool

h: List.length x = List.length y

true.true
โ†‘2 ^ List.length y *       โ†‘(bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
        else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +       -((2 ^ List.length y *             bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
            else 0) +           2 ^ List.length y *             bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
            else 0)) =   โ†‘2 ^ List.length y +     (-โ†‘2 ^ List.length y +       (โ†‘(List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +         -(2 ^ List.length y *             bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
            else 0)))
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

true.false
โ†‘(bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 0 else 1) *       2 ^ List.length y +     โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) =   โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
        else 0) *         2 ^ List.length y +     2 ^ List.length y
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

false.false
โ†‘(bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1 else 0) *       2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
          else 0) *           2 ^ List.length y *         2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     (bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1 else 0) *       2 ^ List.length y
x, y: List Bool

h: List.length x = List.length y

false.true
โ†‘(bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 0 else 1) *       2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +     (-((bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
          else 0) *           2 ^ List.length y) -       2 ^ List.length y)
x, y: List Bool

h: List.length x = List.length y

true.false
โ†‘(bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 0 else 1) *       2 ^ List.length y +     โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) =   โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
        else 0) *         2 ^ List.length y +     2 ^ List.length y
x, y: List Bool

h: List.length x = List.length y

true.true
โ†‘(bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1 else 0) *       2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1
          else 0) *           2 ^ List.length y *         2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     (bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).fst then 1 else 0) *       2 ^ List.length y
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

true.true.false
โ†‘(bif false then 1 else 0) * 2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif false then 1 else 0) * 2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     (bif false then 1 else 0) * 2 ^ List.length y
x, y: List Bool

h: List.length x = List.length y

true.true.true
โ†‘(bif true then 1 else 0) * 2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif true then 1 else 0) * 2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     (bif true then 1 else 0) * 2 ^ List.length y
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

false.false.false
โ†‘(bif false then 1 else 0) * 2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif false then 1 else 0) * 2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     (bif false then 1 else 0) * 2 ^ List.length y
x, y: List Bool

h: List.length x = List.length y

false.false.true
โ†‘(bif true then 1 else 0) * 2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif true then 1 else 0) * 2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     (bif true then 1 else 0) * 2 ^ List.length y
x, y: List Bool

h: List.length x = List.length y

false.true.false
โ†‘(bif false then 0 else 1) * 2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +     (-((bif false then 1 else 0) * 2 ^ List.length y) - 2 ^ List.length y)
x, y: List Bool

h: List.length x = List.length y

false.true.true
โ†‘(bif true then 0 else 1) * 2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +     (-((bif true then 1 else 0) * 2 ^ List.length y) - 2 ^ List.length y)
x, y: List Bool

h: List.length x = List.length y

true.false.false
โ†‘(bif false then 0 else 1) * 2 ^ List.length y +     โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) =   โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif false then 1 else 0) * 2 ^ List.length y +     2 ^ List.length y
x, y: List Bool

h: List.length x = List.length y

true.false.true
โ†‘(bif true then 0 else 1) * 2 ^ List.length y +     โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) =   โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif true then 1 else 0) * 2 ^ List.length y +     2 ^ List.length y
x, y: List Bool

h: List.length x = List.length y

true.true.false
โ†‘(bif false then 1 else 0) * 2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif false then 1 else 0) * 2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     (bif false then 1 else 0) * 2 ^ List.length y
x, y: List Bool

h: List.length x = List.length y

true.true.true
โ†‘(bif true then 1 else 0) * 2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       (bif true then 1 else 0) * 2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     (bif true then 1 else 0) * 2 ^ List.length y
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

true.true.true
2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     2 ^ List.length y
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
x, y: List Bool

h: List.length x = List.length y

false.false.true
2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     2 ^ List.length y
x, y: List Bool

h: List.length x = List.length y

false.true.false
2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +     -2 ^ List.length y
x, y: List Bool

h: List.length x = List.length y

false.true.true
โ†‘(List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     2 ^ List.length y * 2 =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +     (-2 ^ List.length y - 2 ^ List.length y)
x, y: List Bool

h: List.length x = List.length y

true.false.false
2 ^ List.length y +     โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) +     2 ^ List.length y
x, y: List Bool

h: List.length x = List.length y

true.true.true
2 ^ List.length y +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -       2 ^ List.length y * 2) =   โ†‘(List.foldl addLsb 0
        (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor x (xor y c))) x y false).snd) -     2 ^ List.length y
a: Bool

x: List Bool

b: Bool

y: List Bool

h: List.length x = List.length y

(โ†‘(2 ^             List.length
              (xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ::                 (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) *           0 +         ((2 ^               List.length
                (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd *             bif
                xor (xor a b)
                  (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
              1
            else 0) +           List.foldl addLsb 0
            (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd)) -     2 ^ List.length (a :: x) *       bif
          !a && b ||               !a && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst ||             b && (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then
        1
      else 0) =   โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(2 ^ List.length y * bif b then 1 else 0) +     (โ†‘(List.foldl addLsb 0
          (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (!x && y || !x && c || y && c, xor (xor x y) c)) x y false).fst then 1
        else 0)
Goals accomplished! ๐Ÿ™



instance: โˆ€ (n : โ„•), NeZero (2 ^ n)
instance (
n: โ„•
n : 
โ„•: Type
โ„•) : 
NeZero: {R : Type ?u.190128} โ†’ [inst : Zero R] โ†’ R โ†’ Prop
NeZero (
2: ?m.190210
2 ^ 
n: โ„•
n) := โŸจ
Nat.pos_iff_ne_zero: โˆ€ {n : โ„•}, 0 < n โ†” n โ‰  0
Nat.pos_iff_ne_zero.
1: โˆ€ {a b : Prop}, (a โ†” b) โ†’ a โ†’ b
1 <| 
pow_pos: โˆ€ {ฮฑ : Type ?u.190386} [inst : StrictOrderedSemiring ฮฑ] {a : ฮฑ}, 0 < a โ†’ โˆ€ (n : โ„•), 0 < a ^ n
pow_pos (
Goals accomplished! ๐Ÿ™
n: โ„•

0 < 2
Goals accomplished! ๐Ÿ™
) 
_: โ„•
_โŸฉ

theorem 
toZMod_sbb: โˆ€ {n : โ„•} (x y : Bitvec n), toZMod (sbb x y false).snd = toZMod x - toZMod y
toZMod_sbb {
n: โ„•
n : 
โ„•: Type
โ„•} (
x: Bitvec n
x 
y: Bitvec n
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) : (
x: Bitvec n
x.
sbb: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Bool โ†’ Bool ร— Bitvec n
sbb 
y: Bitvec n
y 
false: Bool
false).
2: {ฮฑ : Type ?u.190503} โ†’ {ฮฒ : Type ?u.190502} โ†’ ฮฑ ร— ฮฒ โ†’ ฮฒ
2.
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod = 
x: Bitvec n
x.
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod - 
y: Bitvec n
y.
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod := 
Goals accomplished! ๐Ÿ™
n: โ„•

x, y: Bitvec n

toZMod (sbb x y false).snd = toZMod x - toZMod y
n: โ„•

y: Bitvec n

x: List Bool

hx: List.length x = n

mk
toZMod (sbb { val := x, property := hx } y false).snd = toZMod { val := x, property := hx } - toZMod y
n: โ„•

x, y: Bitvec n

toZMod (sbb x y false).snd = toZMod x - toZMod y
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

mk.mk
toZMod (sbb { val := x, property := hx } { val := y, property := hy } false).snd =   toZMod { val := x, property := hx } - toZMod { val := y, property := hy }
n: โ„•

x, y: Bitvec n

toZMod (sbb x y false).snd = toZMod x - toZMod y
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

mk.mk
โ†‘(List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).snd) =   โ†‘(List.foldl addLsb 0 x) - โ†‘(List.foldl addLsb 0 y)
n: โ„•

x, y: Bitvec n

toZMod (sbb x y false).snd = toZMod x - toZMod y
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

mk.mk
โ†‘(List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).snd) =   โ†‘(List.foldl addLsb 0 x) - โ†‘(List.foldl addLsb 0 y)
Goals accomplished! ๐Ÿ™
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

2 ^ n = 0
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

2 ^ n = 0
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

โ†‘2 ^ n = 0
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

2 ^ n = 0
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

โ†‘(2 ^ n) = 0
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

2 ^ n = 0
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

0 = 0
Goals accomplished! ๐Ÿ™
n: โ„•

x, y: Bitvec n

toZMod (sbb x y false).snd = toZMod x - toZMod y
n: โ„•

x: List Bool

hx: List.length x = n

y: List Bool

hy: List.length y = n

h2n: 2 ^ n = 0

this: โ†‘(โ†‘(List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).snd) -       2 ^ List.length x *         bif (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).fst then 1 else 0) =   โ†‘(โ†‘(List.foldl addLsb 0 x) + -โ†‘(List.foldl addLsb 0 y))

mk.mk
โ†‘(List.foldl addLsb 0 (List.mapAccumrโ‚‚ (fun x y c => (Bitvec.carry (!x) y c, Bitvec.xor3 x y c)) x y false).snd) =   โ†‘(List.foldl addLsb 0 x) - โ†‘(List.foldl addLsb 0 y)
n: โ„•

x, y: Bitvec n

toZMod (sbb x y false).snd = toZMod x - toZMod y
Goals accomplished! ๐Ÿ™


theorem 
toZMod_sub: โˆ€ {n : โ„•} (x y : Bitvec n), toZMod (x - y) = toZMod x - toZMod y
toZMod_sub {
n: โ„•
n : 
โ„•: Type
โ„•} (
x: Bitvec n
x 
y: Bitvec n
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) : (
x: Bitvec n
x - 
y: Bitvec n
y).
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod = 
x: Bitvec n
x.
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod - 
y: Bitvec n
y.
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod :=
  
toZMod_sbb: โˆ€ {n : โ„•} (x y : Bitvec n), toZMod (sbb x y false).snd = toZMod x - toZMod y
toZMod_sbb 
x: Bitvec n
x 
y: Bitvec n
y

theorem 
toInt_neg_aux: โˆ€ (x : List Bool),
  (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =     -โ†‘(List.foldl addLsb 0 x)
toInt_neg_aux : โˆ€ (
x: List Bool
x : 
List: Type ?u.198621 โ†’ Type ?u.198621
List 
Bool: Type
Bool),
    ((
List.foldl: {ฮฑ : Type ?u.198631} โ†’ {ฮฒ : Type ?u.198630} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
List.foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb (
0: ?m.198642
0 : 
โ„•: Type
โ„•) (
List.mapAccumr: {ฯƒ : Type ?u.198654} โ†’ {ฮฑ : Type ?u.198653} โ†’ {ฮฒ : Type ?u.198652} โ†’ (ฮฑ โ†’ ฯƒ โ†’ ฯƒ ร— ฮฒ) โ†’ List ฮฑ โ†’ ฯƒ โ†’ ฯƒ ร— List ฮฒ
List.mapAccumr (fun 
y: ?m.198659
y 
c: ?m.198662
c => (
y: ?m.198659
y || 
c: ?m.198662
c, 
xor: Bool โ†’ Bool โ†’ Bool
xor 
y: ?m.198659
y 
c: ?m.198662
c)) 
x: List Bool
x 
false: Bool
false).
snd: {ฮฑ : Type ?u.198680} โ†’ {ฮฒ : Type ?u.198679} โ†’ ฮฑ ร— ฮฒ โ†’ ฮฒ
snd : 
โ„•: Type
โ„•) 
      - 
2: ?m.198690
2 ^ 
x: List Bool
x.
length: {ฮฑ : Type ?u.198699} โ†’ List ฮฑ โ†’ โ„•
length * 
cond: {ฮฑ : Type ?u.198703} โ†’ Bool โ†’ ฮฑ โ†’ ฮฑ โ†’ ฮฑ
cond (
List.mapAccumr: {ฯƒ : Type ?u.198707} โ†’ {ฮฑ : Type ?u.198706} โ†’ {ฮฒ : Type ?u.198705} โ†’ (ฮฑ โ†’ ฯƒ โ†’ ฯƒ ร— ฮฒ) โ†’ List ฮฑ โ†’ ฯƒ โ†’ ฯƒ ร— List ฮฒ
List.mapAccumr (fun 
y: ?m.198712
y 
c: ?m.198715
c => (
y: ?m.198712
y || 
c: ?m.198715
c, 
xor: Bool โ†’ Bool โ†’ Bool
xor 
y: ?m.198712
y 
c: ?m.198715
c)) 
x: List Bool
x 
false: Bool
false).
fst: {ฮฑ : Type ?u.198730} โ†’ {ฮฒ : Type ?u.198729} โ†’ ฮฑ ร— ฮฒ โ†’ ฮฑ
fst 
1: ?m.198734
1 
0: ?m.198744
0 : 
โ„ค: Type
โ„ค) = 
      -(
List.foldl: {ฮฑ : Type ?u.199137} โ†’ {ฮฒ : Type ?u.199136} โ†’ (ฮฑ โ†’ ฮฒ โ†’ ฮฑ) โ†’ ฮฑ โ†’ List ฮฒ โ†’ ฮฑ
List.foldl 
addLsb: โ„• โ†’ Bool โ†’ โ„•
addLsb 
0: ?m.199147
0 
x: List Bool
x)
  | [] => 
rfl: โˆ€ {ฮฑ : Sort ?u.199505} {a : ฮฑ}, a = a
rfl
  | 
a: Bool
a::
x: List Bool
x => 
Goals accomplished! ๐Ÿ™
a: Bool

x: List Bool

(โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) (a :: x) false).snd) -     2 ^ List.length (a :: x) * bif (List.mapAccumr (fun y c => (y || c, xor y c)) (a :: x) false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
a: Bool

x: List Bool

(โ†‘(List.foldl addLsb 0
        (xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst ::           (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd)) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
a: Bool

x: List Bool

(โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) (a :: x) false).snd) -     2 ^ List.length (a :: x) * bif (List.mapAccumr (fun y c => (y || c, xor y c)) (a :: x) false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
a: Bool

x: List Bool

(โ†‘(List.foldl addLsb 0
        (xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst ::           (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd)) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
a: Bool

x: List Bool

(โ†‘((2 ^ List.length (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd *           bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +         List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
a: Bool

x: List Bool

(โ†‘(List.foldl addLsb 0
        (xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst ::           (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd)) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
a: Bool

x: List Bool

(โ†‘((2 ^ List.length (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd *           bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +         List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘((2 ^ List.length x * bif a then 1 else 0) + List.foldl addLsb 0 x)
a: Bool

x: List Bool

(โ†‘(List.foldl addLsb 0
        (xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst ::           (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd)) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
a: Bool

x: List Bool

(โ†‘(2 ^ List.length (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd *           bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘((2 ^ List.length x * bif a then 1 else 0) + List.foldl addLsb 0 x)
a: Bool

x: List Bool

(โ†‘(List.foldl addLsb 0
        (xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst ::           (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd)) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
a: Bool

x: List Bool

(โ†‘(2 ^ List.length (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd *           bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(โ†‘(2 ^ List.length x * bif a then 1 else 0) + โ†‘(List.foldl addLsb 0 x))
a: Bool

x: List Bool

(โ†‘(List.foldl addLsb 0
        (xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst ::           (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd)) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
a: Bool

x: List Bool

(โ†‘(2 ^ List.length (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd *           bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘(2 ^ List.length x * bif a then 1 else 0) + -โ†‘(List.foldl addLsb 0 x)
a: Bool

x: List Bool

(โ†‘(List.foldl addLsb 0
        (xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst ::           (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd)) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
a: Bool

x: List Bool

(โ†‘(2 ^ List.length (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd *           bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘(2 ^ List.length x * bif a then 1 else 0) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
a: Bool

x: List Bool

(โ†‘(2 ^ List.length (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd *           bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ List.length (a :: x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -โ†‘(2 ^ List.length x * bif a then 1 else 0) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
a: Bool

x: List Bool

(โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) (a :: x) false).snd) -     2 ^ List.length (a :: x) * bif (List.mapAccumr (fun y c => (y || c, xor y c)) (a :: x) false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
a: Bool

x: List Bool

(2 ^ List.length x * โ†‘(bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif a then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
a: Bool

x: List Bool

(โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) (a :: x) false).snd) -     2 ^ List.length (a :: x) * bif (List.mapAccumr (fun y c => (y || c, xor y c)) (a :: x) false).fst then 1 else 0) =   -โ†‘(List.foldl addLsb 0 (a :: x))
x: List Bool

false
(2 ^ List.length x * โ†‘(bif xor false (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) *       bif false || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif false then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
x: List Bool

true
(2 ^ List.length x * โ†‘(bif xor true (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) *       bif true || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif true then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
a: Bool

x: List Bool

(2 ^ List.length x * โ†‘(bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif a then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
x: List Bool

false
(2 ^ List.length x * โ†‘(bif xor false (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) *       bif false || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif false then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
x: List Bool

true
(2 ^ List.length x * โ†‘(bif xor true (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) *       bif true || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif true then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
a: Bool

x: List Bool

(2 ^ List.length x * โ†‘(bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif a then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
x: List Bool

true.false
(2 ^ List.length x * โ†‘(bif xor true false then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif true || false then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif true then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif false then 1 else 0)
x: List Bool

true.true
(2 ^ List.length x * โ†‘(bif xor true true then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif true || true then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif true then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif true then 1 else 0)
a: Bool

x: List Bool

(2 ^ List.length x * โ†‘(bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif a then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
x: List Bool

false.false
(2 ^ List.length x * โ†‘(bif xor false false then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif false || false then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif false then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif false then 1 else 0)
x: List Bool

false.true
(2 ^ List.length x * โ†‘(bif xor false true then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif false || true then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif false then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif true then 1 else 0)
x: List Bool

true.false
(2 ^ List.length x * โ†‘(bif xor true false then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif true || false then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif true then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif false then 1 else 0)
x: List Bool

true.true
(2 ^ List.length x * โ†‘(bif xor true true then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif true || true then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif true then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif true then 1 else 0)
a: Bool

x: List Bool

(2 ^ List.length x * โ†‘(bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif a then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
x: List Bool

false.true
2 ^ List.length x + โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) +     (-2 ^ List.length x + -2 ^ List.length x) =   โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) + -2 ^ List.length x
a: Bool

x: List Bool

(2 ^ List.length x * โ†‘(bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif a then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
x: List Bool

false.true
2 ^ List.length x + โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) +     (-2 ^ List.length x + -2 ^ List.length x) =   โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) + -2 ^ List.length x
x: List Bool

true.false
2 ^ List.length x + โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) +     (-2 ^ List.length x + -2 ^ List.length x) =   -2 ^ List.length x + โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd)
x: List Bool

true.true
โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) +     (-2 ^ List.length x + -2 ^ List.length x) =   -2 ^ List.length x +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) + -2 ^ List.length x)
a: Bool

x: List Bool

(2 ^ List.length x * โ†‘(bif xor a (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) +       โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -     2 ^ Nat.succ (List.length x) * bif a || (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   -(2 ^ List.length x * โ†‘(bif a then 1 else 0)) +     (โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0)
Goals accomplished! ๐Ÿ™

    
theorem 
toZMod_neg: โˆ€ {n : โ„•} (x : Bitvec n), toZMod (-x) = -toZMod x
toZMod_neg {
n: โ„•
n : 
โ„•: Type
โ„•} (
x: Bitvec n
x : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) : (-
x: Bitvec n
x).
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod = -
x: Bitvec n
x.
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod := 
Goals accomplished! ๐Ÿ™
n: โ„•

x: Bitvec n

toZMod (-x) = -toZMod x
n: โ„•

x: Bitvec n

toZMod (Bitvec.neg x) = -toZMod x
n: โ„•

x: Bitvec n

toZMod (-x) = -toZMod x
n: โ„•

x: List Bool

hx: List.length x = n

mk
toZMod (Bitvec.neg { val := x, property := hx }) = -toZMod { val := x, property := hx }
n: โ„•

x: Bitvec n

toZMod (-x) = -toZMod x
n: โ„•

x: List Bool

hx: List.length x = n

mk
โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) = -โ†‘(List.foldl addLsb 0 x)
n: โ„•

x: Bitvec n

toZMod (-x) = -toZMod x
n: โ„•

x: List Bool

hx: List.length x = n

mk
โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) = -โ†‘(List.foldl addLsb 0 x)
Goals accomplished! ๐Ÿ™
n: โ„•

x: List Bool

hx: List.length x = n

2 ^ n = 0
n: โ„•

x: List Bool

hx: List.length x = n

2 ^ n = 0
n: โ„•

x: List Bool

hx: List.length x = n

โ†‘2 ^ n = 0
n: โ„•

x: List Bool

hx: List.length x = n

2 ^ n = 0
n: โ„•

x: List Bool

hx: List.length x = n

โ†‘(2 ^ n) = 0
n: โ„•

x: List Bool

hx: List.length x = n

2 ^ n = 0
n: โ„•

x: List Bool

hx: List.length x = n

0 = 0
Goals accomplished! ๐Ÿ™
n: โ„•

x: Bitvec n

toZMod (-x) = -toZMod x
n: โ„•

x: List Bool

hx: List.length x = n

h2n: 2 ^ n = 0

this: โ†‘(โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   โ†‘(-โ†‘(List.foldl addLsb 0 x))

mk
โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) = -โ†‘(List.foldl addLsb 0 x)
n: โ„•

x: Bitvec n

toZMod (-x) = -toZMod x
x: List Bool

h2n: 2 ^ List.length x = 0

this: โ†‘(โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) -       2 ^ List.length x * bif (List.mapAccumr (fun y c => (y || c, xor y c)) x false).fst then 1 else 0) =   โ†‘(-โ†‘(List.foldl addLsb 0 x))

mk
โ†‘(List.foldl addLsb 0 (List.mapAccumr (fun y c => (y || c, xor y c)) x false).snd) = -โ†‘(List.foldl addLsb 0 x)
n: โ„•

x: Bitvec n

toZMod (-x) = -toZMod x
Goals accomplished! ๐Ÿ™



instance: {n : โ„•} โ†’ SMul โ„ค (Bitvec n)
instance : 
SMul: Type ?u.224307 โ†’ Type ?u.224306 โ†’ Type (max?u.224307?u.224306)
SMul 
โ„ค: Type
โ„ค (
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.224303
n) := โŸจ
zsmulRec: {M : Type ?u.224319} โ†’ [inst : Zero M] โ†’ [inst : Add M] โ†’ [inst : Neg M] โ†’ โ„ค โ†’ M โ†’ M
zsmulRecโŸฉ

theorem 
zsmul_def: โˆ€ {n : โ„•} (x : Bitvec n) (y : โ„ค), y โ€ข x = zsmulRec y x
zsmul_def {
n: โ„•
n : 
โ„•: Type
โ„•} (
x: Bitvec n
x : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) (
y: โ„ค
y : 
โ„ค: Type
โ„ค) : 
y: โ„ค
y โ€ข 
x: Bitvec n
x = 
zsmulRec: {M : Type ?u.224706} โ†’ [inst : Zero M] โ†’ [inst : Add M] โ†’ [inst : Neg M] โ†’ โ„ค โ†’ M โ†’ M
zsmulRec 
y: โ„ค
y 
x: Bitvec n
x := 
rfl: โˆ€ {ฮฑ : Sort ?u.224749} {a : ฮฑ}, a = a
rfl

@[simp]
theorem 
toZMod_zsmul: โˆ€ {n : โ„•} (x : Bitvec n) (y : โ„ค), toZMod (y โ€ข x) = y โ€ข toZMod x
toZMod_zsmul {
n: โ„•
n : 
โ„•: Type
โ„•} (
x: Bitvec n
x : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) (
y: โ„ค
y : 
โ„ค: Type
โ„ค) : (
y: โ„ค
y โ€ข 
x: Bitvec n
x).
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod = 
y: โ„ค
y โ€ข 
x: Bitvec n
x.
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod := 
Goals accomplished! ๐Ÿ™
n: โ„•

x: Bitvec n

y: โ„ค

toZMod (y โ€ข x) = y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„ค

toZMod (y โ€ข x) = y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

ofNat
toZMod (Int.ofNat y โ€ข x) = Int.ofNat y โ€ข toZMod x
Goals accomplished! ๐Ÿ™
n: โ„•

x: Bitvec n

y: โ„ค

toZMod (y โ€ข x) = y โ€ข toZMod x
n: โ„•

x: Bitvec n

y: โ„•

negSucc
toZMod (Int.negSucc y โ€ข x) = Int.negSucc y โ€ข toZMod x
Goals accomplished! ๐Ÿ™



instance: {n : โ„•} โ†’ AddCommGroup (Bitvec n)
instance : 
AddCommGroup: Type ?u.229234 โ†’ Type ?u.229234
AddCommGroup (
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.229231
n) := 
  
Function.Injective.addCommGroup: {Mโ‚ : Type ?u.229238} โ†’
  {Mโ‚‚ : Type ?u.229237} โ†’
    [inst : Add Mโ‚] โ†’
      [inst_1 : Zero Mโ‚] โ†’
        [inst_2 : SMul โ„• Mโ‚] โ†’
          [inst_3 : Neg Mโ‚] โ†’
            [inst_4 : Sub Mโ‚] โ†’
              [inst_5 : SMul โ„ค Mโ‚] โ†’
                [inst_6 : AddCommGroup Mโ‚‚] โ†’
                  (f : Mโ‚ โ†’ Mโ‚‚) โ†’
                    Function.Injective f โ†’
                      f 0 = 0 โ†’
                        (โˆ€ (x y : Mโ‚), f (x + y) = f x + f y) โ†’
                          (โˆ€ (x : Mโ‚), f (-x) = -f x) โ†’
                            (โˆ€ (x y : Mโ‚), f (x - y) = f x - f y) โ†’
                              (โˆ€ (x : Mโ‚) (n : โ„•), f (n โ€ข x) = n โ€ข f x) โ†’
                                (โˆ€ (x : Mโ‚) (n : โ„ค), f (n โ€ข x) = n โ€ข f x) โ†’ AddCommGroup Mโ‚
Function.Injective.addCommGroup 
toZMod: {n : โ„•} โ†’ Bitvec n โ†’ ZMod (2 ^ n)
toZMod 
    (
Function.injective_iff_hasLeftInverse: โˆ€ {ฮฑ : Sort ?u.229670} {ฮฒ : Sort ?u.229671} [inst : Nonempty ฮฑ] {f : ฮฑ โ†’ ฮฒ},
  Function.Injective f โ†” Function.HasLeftInverse f
Function.injective_iff_hasLeftInverse.
2: โˆ€ {a b : Prop}, (a โ†” b) โ†’ b โ†’ a
2 โŸจ
_: ?m.229737
_, 
ofZMod_toZMod: โˆ€ {n : โ„•} (v : Bitvec n), ofZMod (toZMod v) = v
ofZMod_toZModโŸฉ) 
    
toZMod_zero: โˆ€ {n : โ„•}, toZMod 0 = 0
toZMod_zero 
toZMod_add: โˆ€ {n : โ„•} (x y : Bitvec n), toZMod (x + y) = toZMod x + toZMod y
toZMod_add 
toZMod_neg: โˆ€ {n : โ„•} (x : Bitvec n), toZMod (-x) = -toZMod x
toZMod_neg 
toZMod_sub: โˆ€ {n : โ„•} (x y : Bitvec n), toZMod (x - y) = toZMod x - toZMod y
toZMod_sub 
toZMod_nsmul: โˆ€ {n : โ„•} (x : Bitvec n) (y : โ„•), toZMod (y โ€ข x) = y โ€ข toZMod x
toZMod_nsmul 
toZMod_zsmul: โˆ€ {n : โ„•} (x : Bitvec n) (y : โ„ค), toZMod (y โ€ข x) = y โ€ข toZMod x
toZMod_zsmul

-- see https://leanprover.zulipchat.com/#narrow/stream/270676-lean4/topic/Pattern.20matching.20subtypes
def 
add?: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Option (Bitvec n)
add? {
n: โ„•
n : 
Nat: Type
Nat} (
x: Bitvec n
x 
y: Bitvec n
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) : 
Option: Type ?u.230522 โ†’ Type ?u.230522
Option (
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) := match 
Bitvec.adc: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Bool โ†’ Bitvec (n + 1)
Bitvec.adc 
x: Bitvec n
x 
y: Bitvec n
y 
false: Bool
false with
  | โŸจ
false: Bool
false :: 
z: List Bool
z,
hcons: List.length (false :: z) = n + 1
hconsโŸฉ => 
some: {ฮฑ : Type ?u.230572} โ†’ ฮฑ โ†’ Option ฮฑ
some โŸจ
z: List Bool
z, 
Goals accomplished! ๐Ÿ™
n: โ„•

x, y: Bitvec n

z: List Bool

hcons: List.length (false :: z) = n + 1

List.length z = n
Goals accomplished! ๐Ÿ™
โŸฉ
  | _ => 
none: {ฮฑ : Type ?u.230593} โ†’ Option ฮฑ
none -- overflow


theorem 
Warning: declaration uses 'sorry'
 {
n: โ„•
n : 
Nat: Type
Nat} {
x: Bitvec n
x 
y: Bitvec n
y 
z: Bitvec n
z : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n} : 
add?: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Option (Bitvec n)
add? 
x: Bitvec n
x 
y: Bitvec n
y = 
some: {ฮฑ : Type ?u.231412} โ†’ ฮฑ โ†’ Option ฮฑ
some 
z: Bitvec n
z โ†’ 
x: Bitvec n
x + 
y: Bitvec n
y = 
z: Bitvec n
z := 
sorry: ?m.231468
sorry

/-
#eval  (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท).toNat * (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท).toNat
#eval  Bitvec.mul (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท) (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท) |>.toNat
-/
protected def 
mul?: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Option (Bitvec n)
mul? {
n: โ„•
n : 
Nat: Type
Nat} (
x: Bitvec n
x 
y: Bitvec n
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) : 
Option: Type ?u.231483 โ†’ Type ?u.231483
Option (
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n) := do
  let 
f: (r : ?m.231507) โ†’ (b : ?m.231515 r) โ†’ ?m.231516 r b
f 
r: ?m.231507
r 
b: ?m.231510
b := do 
    let 
opโ‚: ?m.231674
opโ‚ โ† 
Bitvec.add?: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Option (Bitvec n)
Bitvec.add? 
r: ?m.231507
r 
r: ?m.231507
r 
    let 
opโ‚‚: ?m.231723
opโ‚‚ โ† 
Bitvec.add?: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Option (Bitvec n)
Bitvec.add? 
opโ‚: ?m.231674
opโ‚ 
y: Bitvec n
y
    return 
cond: {ฮฑ : Type ?u.231743} โ†’ Bool โ†’ ฮฑ โ†’ ฮฑ โ†’ ฮฑ
cond 
b: ?m.231510
b 
opโ‚‚: ?m.231723
opโ‚‚ 
opโ‚: ?m.231674
opโ‚
  (
x: Bitvec n
x.
toList: {ฮฑ : Type ?u.231519} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList).
foldlM: {m : Type ?u.231529 โ†’ Type ?u.231528} โ†’
  [inst : Monad m] โ†’ {s : Type ?u.231529} โ†’ {ฮฑ : Type ?u.231527} โ†’ (s โ†’ ฮฑ โ†’ m s) โ†’ s โ†’ List ฮฑ โ†’ m s
foldlM 
f: (r : ?m.231507) โ†’ (b : ?m.231515 r) โ†’ ?m.231516 r b
f 
0: ?m.231587
0

/-
#eval  Bitvec.mul? (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท) (๐Ÿท๐Ÿถ๐Ÿท๐Ÿท)
#eval  Bitvec.mul? (๐Ÿถ๐Ÿถ๐Ÿถ๐Ÿถ๐Ÿถ๐Ÿถ๐Ÿท๐Ÿถ๐Ÿท๐Ÿท) (๐Ÿถ๐Ÿถ๐Ÿถ๐Ÿถ๐Ÿถ๐Ÿถ๐Ÿท๐Ÿถ๐Ÿท๐Ÿท) |>.get!|>.toNat
-/
theorem 
Warning: declaration uses 'sorry'
 : โˆ€ {
n: โ„•
n : 
Nat: Type
Nat} {
x: Bitvec n
x 
y: Bitvec n
y 
z: Bitvec n
z : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: โ„•
n}, 
Bitvec.mul?: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Option (Bitvec n)
Bitvec.mul? 
x: Bitvec n
x 
y: Bitvec n
y = 
some: {ฮฑ : Type ?u.232218} โ†’ ฮฑ โ†’ Option ฮฑ
some 
z: Bitvec n
z โ†’ 
x: Bitvec n
x * 
y: Bitvec n
y = 
z: Bitvec n
z := 
sorry: ?m.232282
sorry

/--
The value produced is the unsigned integer quotient of the two operands.
Note that unsigned integer division and signed integer division are distinct operations; for signed integer division, use โ€˜sdivโ€™.
Division by zero is undefined behavior.
-/
def 
udiv?: {w : โ„•} โ†’ Bitvec w โ†’ Bitvec w โ†’ Option (Bitvec w)
udiv? {
w: โ„•
w : 
Nat: Type
Nat} (
x: Bitvec w
x 
y: Bitvec w
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w) : 
Option: Type ?u.232301 โ†’ Type ?u.232301
Option $ 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w :=
  match 
y: Bitvec w
y.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat with
    | 
0: โ„•
0 => 
none: {ฮฑ : Type ?u.232328} โ†’ Option ฮฑ
none
    | _ => 
some: {ฮฑ : Type ?u.232338} โ†’ ฮฑ โ†’ Option ฮฑ
some $ 
Bitvec.ofNat: (n : โ„•) โ†’ โ„• โ†’ Bitvec n
Bitvec.ofNat 
w: โ„•
w (
x: Bitvec w
x.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat / 
y: Bitvec w
y.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat)

/--
The value produced is the signed integer quotient of the two operands rounded towards zero.
Note that signed integer division and unsigned integer division are distinct operations; for unsigned integer division, use โ€˜udivโ€™.
Division by zero is undefined behavior.
Overflow also leads to undefined behavior; this is a rare case, but can occur, for example, by doing a 32-bit division of -2147483648 by -1.
-/
def 
sdiv?: {w : โ„•} โ†’ Bitvec w โ†’ Bitvec w โ†’ Option (Bitvec w)
sdiv? {
w: โ„•
w : 
Nat: Type
Nat} (
x: Bitvec w
x 
y: Bitvec w
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w) : 
Option: Type ?u.232662 โ†’ Type ?u.232662
Option $ 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w := 
  if 
y: Bitvec w
y.
toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
toInt = 
0: ?m.232673
0 
  then 
none: {ฮฑ : Type ?u.232711} โ†’ Option ฮฑ
none
  else 
    let 
div: ?m.232715
div := (
x: Bitvec w
x.
toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
toInt / 
y: Bitvec w
y.
toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
toInt)
    if 
div: ?m.232715
div < 
2: ?m.232782
2^
w: โ„•
w 
      then 
some: {ฮฑ : Type ?u.233013} โ†’ ฮฑ โ†’ Option ฮฑ
some $ 
Bitvec.ofInt': (n : โ„•) โ†’ โ„ค โ†’ Bitvec n
Bitvec.ofInt' 
w: โ„•
w 
div: ?m.232715
div
      else 
none: {ฮฑ : Type ?u.233015} โ†’ Option ฮฑ
none

/--
This instruction returns the unsigned integer remainder of a division. This instruction always performs an unsigned division to get the remainder.
Note that unsigned integer remainder and signed integer remainder are distinct operations; for signed integer remainder, use โ€˜sremโ€™.
Taking the remainder of a division by zero is undefined behavior. 
-/
def 
urem?: {w : โ„•} โ†’ Bitvec w โ†’ Bitvec w โ†’ Option (Bitvec w)
urem? {
w: โ„•
w : 
Nat: Type
Nat} (
x: Bitvec w
x 
y: Bitvec w
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w) : 
Option: Type ?u.233348 โ†’ Type ?u.233348
Option $ 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w :=
  if 
y: Bitvec w
y.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat = 
0: ?m.233359
0 
  then 
none: {ฮฑ : Type ?u.233397} โ†’ Option ฮฑ
none
  else 
some: {ฮฑ : Type ?u.233400} โ†’ ฮฑ โ†’ Option ฮฑ
some $ 
Bitvec.ofNat: (n : โ„•) โ†’ โ„• โ†’ Bitvec n
Bitvec.ofNat 
w: โ„•
w (
x: Bitvec w
x.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat % 
y: Bitvec w
y.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat)

def 
_root_.Int.rem: โ„ค โ†’ โ„ค โ†’ โ„ค
_root_.Int.rem (
x: โ„ค
x 
y: โ„ค
y : 
Int: Type
Int) : 
Int: Type
Int :=
  if 
x: โ„ค
x โ‰ฅ 
0: ?m.233574
0 then (
x: โ„ค
x % 
y: โ„ค
y) else ((
x: โ„ค
x % 
y: โ„ค
y) - |
y: โ„ค
y|)

-- TODO: prove this to make sure it's the right implementation!
theorem 
Warning: declaration uses 'sorry'
 : 
  โˆ€ 
x: ?m.234142
x 
y: ?m.234145
y, 
Int.rem: โ„ค โ†’ โ„ค โ†’ โ„ค
Int.rem 
x: ?m.234142
x 
y: ?m.234145
y < 
0: ?m.234150
0 โ†” 
x: ?m.234142
x < 
0: ?m.234180
0 :=  
Goals accomplished! ๐Ÿ™
โˆ€ (x y : โ„ค), Int.rem x y < 0 โ†” x < 0
Goals accomplished! ๐Ÿ™


/--
This instruction returns the remainder of a division (where the result is either zero or has the same sign as the dividend, op1), 
not the modulo operator (where the result is either zero or has the same sign as the divisor, op2) of a value.
For more information about the difference, see The Math Forum.
For a table of how this is implemented in various languages, please see Wikipedia: modulo operation.
Note that signed integer remainder and unsigned integer remainder are distinct operations; for unsigned integer remainder, use โ€˜uremโ€™.
Taking the remainder of a division by zero is undefined behavior.
For vectors, if any element of the divisor is zero, the operation has undefined behavior.
Overflow also leads to undefined behavior; this is a rare case, but can occur, for example,
by taking the remainder of a 32-bit division of -2147483648 by -1.
(The remainder doesnโ€™t actually overflow, but this rule lets srem be implemented using instructions that return both the result
of the division and the remainder.)
-/
def 
srem?: {w : โ„•} โ†’ Bitvec w โ†’ Bitvec w โ†’ Option (Bitvec w)
srem? {
w: โ„•
w : 
Nat: Type
Nat} (
x: Bitvec w
x 
y: Bitvec w
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w) : 
Option: Type ?u.234212 โ†’ Type ?u.234212
Option $ 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w :=
  if 
y: Bitvec w
y.
toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
toInt = 
0: ?m.234223
0 
  then 
none: {ฮฑ : Type ?u.234261} โ†’ Option ฮฑ
none
  else
    let 
div: ?m.234265
div := (
x: Bitvec w
x.
toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
toInt / 
y: Bitvec w
y.
toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
toInt)
    if 
div: ?m.234265
div < 
2: ?m.234332
2^
w: โ„•
w 
      then 
some: {ฮฑ : Type ?u.234563} โ†’ ฮฑ โ†’ Option ฮฑ
some $ 
Bitvec.ofInt': (n : โ„•) โ†’ โ„ค โ†’ Bitvec n
Bitvec.ofInt' 
w: โ„•
w (
x: Bitvec w
x.
toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
toInt.
rem: โ„ค โ†’ โ„ค โ†’ โ„ค
rem 
y: Bitvec w
y.
toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
toInt)
      else 
none: {ฮฑ : Type ?u.234571} โ†’ Option ฮฑ
none

/--
 If the condition is an i1 and it evaluates to 1, the instruction returns the first value argument; otherwise, it returns the second value argument.
-/
def 
select: {w : โ„•} โ†’ Bitvec 1 โ†’ Bitvec w โ†’ Bitvec w โ†’ Bitvec w
select {
w: โ„•
w : 
Nat: Type
Nat} (
c: Bitvec 1
c : 
Bitvec: โ„• โ†’ Type
Bitvec 
1: ?m.234884
1) (
x: Bitvec w
x 
y: Bitvec w
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w) : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w :=
  
cond: {ฮฑ : Type ?u.234909} โ†’ Bool โ†’ ฮฑ โ†’ ฮฑ โ†’ ฮฑ
cond 
c: Bitvec 1
c.
head: {ฮฑ : Type ?u.234911} โ†’ {n : โ„•} โ†’ Vector ฮฑ (Nat.succ n) โ†’ ฮฑ
head 
x: Bitvec w
x 
y: Bitvec w
y

theorem 
bitwise_eq_eq: โˆ€ {w : โ„•} {x y : Bitvec w}, (โˆ€ (i : Fin w), x[i] = y[i]) โ†” x = y
bitwise_eq_eq {
w: โ„•
w : 
Nat: Type
Nat} {
x: Bitvec w
x 
y: Bitvec w
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w} :
    (forall 
i: Fin w
i : 
Fin: โ„• โ†’ Type
Fin 
w: โ„•
w, 
x: Bitvec w
x[
i: Fin w
i] = 
y: Bitvec w
y[
i: Fin w
i]) โ†” 
x: Bitvec w
x = 
y: Bitvec w
y :=
  โŸจ
Vector.ext: โˆ€ {n : โ„•} {ฮฑ : Type ?u.235387} {v w : Vector ฮฑ n}, (โˆ€ (m : Fin n), Vector.get v m = Vector.get w m) โ†’ v = w
Vector.ext, fun 
h: ?m.235422
h 
_: ?m.235425
_ => 
h: ?m.235422
h โ–ธ 
rfl: โˆ€ {ฮฑ : Sort ?u.235427} {a : ฮฑ}, a = a
rflโŸฉ 

theorem 
ext_get?: โˆ€ {w : โ„•} {x y : Bitvec w}, (โˆ€ (i : โ„•), List.get? (Vector.toList x) i = List.get? (Vector.toList y) i) โ†’ x = y
ext_get? {
w: โ„•
w : 
Nat: Type
Nat} {
x: Bitvec w
x 
y: Bitvec w
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w} (
h: โˆ€ (i : โ„•), List.get? (Vector.toList x) i = List.get? (Vector.toList y) i
h : โˆ€ 
i: ?m.235461
i, 
x: Bitvec w
x.
toList: {ฮฑ : Type ?u.235465} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList.
get?: {ฮฑ : Type ?u.235470} โ†’ List ฮฑ โ†’ โ„• โ†’ Option ฮฑ
get? 
i: ?m.235461
i = 
y: Bitvec w
y.
toList: {ฮฑ : Type ?u.235476} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList.
get?: {ฮฑ : Type ?u.235479} โ†’ List ฮฑ โ†’ โ„• โ†’ Option ฮฑ
get? 
i: ?m.235461
i) : 
x: Bitvec w
x = 
y: Bitvec w
y := 
Goals accomplished! ๐Ÿ™
w: โ„•

x, y: Bitvec w

h: โˆ€ (i : โ„•), List.get? (Vector.toList x) i = List.get? (Vector.toList y) i

x = y
x: List Bool

y: Bitvec (List.length x)

h: โˆ€ (i : โ„•),
  List.get? (Vector.toList { val := x, property := (_ : List.length x = List.length x) }) i =     List.get? (Vector.toList y) i

mk
{ val := x, property := (_ : List.length x = List.length x) } = y
w: โ„•

x, y: Bitvec w

h: โˆ€ (i : โ„•), List.get? (Vector.toList x) i = List.get? (Vector.toList y) i

x = y
x, y: List Bool

hy: List.length y = List.length x

h: โˆ€ (i : โ„•),
  List.get? (Vector.toList { val := x, property := (_ : List.length x = List.length x) }) i =     List.get? (Vector.toList { val := y, property := hy }) i

mk.mk
{ val := x, property := (_ : List.length x = List.length x) } = { val := y, property := hy }
w: โ„•

x, y: Bitvec w

h: โˆ€ (i : โ„•), List.get? (Vector.toList x) i = List.get? (Vector.toList y) i

x = y
Goals accomplished! ๐Ÿ™


@[simp]
theorem 
toList_cong: โˆ€ {wโ‚ wโ‚‚ : โ„•} (h : wโ‚ = wโ‚‚) (b : Bitvec wโ‚), Vector.toList (Bitvec.cong h b) = Vector.toList b
toList_cong {
wโ‚: โ„•
wโ‚ 
wโ‚‚: โ„•
wโ‚‚ : 
Nat: Type
Nat} (
h: wโ‚ = wโ‚‚
h : 
wโ‚: โ„•
wโ‚ = 
wโ‚‚: โ„•
wโ‚‚) (
b: Bitvec wโ‚
b : 
Bitvec: โ„• โ†’ Type
Bitvec 
wโ‚: โ„•
wโ‚) : (
Bitvec.cong: {a b : โ„•} โ†’ a = b โ†’ Bitvec a โ†’ Bitvec b
Bitvec.cong 
h: wโ‚ = wโ‚‚
h 
b: Bitvec wโ‚
b).
toList: {ฮฑ : Type ?u.235638} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList = 
b: Bitvec wโ‚
b.
toList: {ฮฑ : Type ?u.235646} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList := 
  
Goals accomplished! ๐Ÿ™
wโ‚, wโ‚‚: โ„•

h: wโ‚ = wโ‚‚

b: Bitvec wโ‚

Vector.toList (Bitvec.cong h b) = Vector.toList b
wโ‚: โ„•

b: Bitvec wโ‚

Vector.toList (Bitvec.cong (_ : wโ‚ = wโ‚) b) = Vector.toList b
wโ‚: โ„•

b: Bitvec wโ‚

Vector.toList (Bitvec.cong (_ : wโ‚ = wโ‚) b) = Vector.toList b
wโ‚, wโ‚‚: โ„•

h: wโ‚ = wโ‚‚

b: Bitvec wโ‚

Vector.toList (Bitvec.cong h b) = Vector.toList b
Goals accomplished! ๐Ÿ™


theorem 
get?_shl: โˆ€ {n : โ„•} (x : Bitvec n) (i j : โ„•),
  List.get? (Vector.toList (shl x i)) j =     if i + j < n then List.get? (Vector.toList x) (i + j) else if j < n then some false else none
get?_shl (
x: Bitvec n
x : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.235708
n) (
i: โ„•
i 
j: โ„•
j : 
โ„•: Type
โ„•) : 
    (
x: Bitvec n
x.
shl: {n : โ„•} โ†’ Bitvec n โ†’ โ„• โ†’ Bitvec n
shl 
i: โ„•
i).
toList: {ฮฑ : Type ?u.235723} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList.
get?: {ฮฑ : Type ?u.235728} โ†’ List ฮฑ โ†’ โ„• โ†’ Option ฮฑ
get? 
j: โ„•
j = 
      if 
i: โ„•
i + 
j: โ„•
j < 
n: ?m.235708
n 
      then 
x: Bitvec n
x.
toList: {ฮฑ : Type ?u.235784} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList.
get?: {ฮฑ : Type ?u.235787} โ†’ List ฮฑ โ†’ โ„• โ†’ Option ฮฑ
get? (
i: โ„•
i + 
j: โ„•
j) 
      else if 
j: โ„•
j < 
n: ?m.235708
n then 
false: Bool
false
      else 
none: {ฮฑ : Type ?u.235917} โ†’ Option ฮฑ
none := 
Goals accomplished! ๐Ÿ™
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (shl x i)) j =   if i + j < n then List.get? (Vector.toList x) (i + j) else if j < n then some false else none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get?
    (Vector.toList
      (Bitvec.cong (_ : n - i + min n i = n) (Vector.append (Vector.drop i x) (Vector.replicate (min n i) false))))
    j =   if i + j < n then List.get? (Vector.toList x) (i + j) else if j < n then some false else none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (shl x i)) j =   if i + j < n then List.get? (Vector.toList x) (i + j) else if j < n then some false else none
i, j: โ„•

x: List Bool

mk
List.get?
    (Vector.toList
      (Bitvec.cong (_ : List.length x - i + min (List.length x) i = List.length x)
        (Vector.append (Vector.drop i { val := x, property := (_ : List.length x = List.length x) })
          (Vector.replicate (min (List.length x) i) false))))
    j =   if i + j < List.length x then
    List.get? (Vector.toList { val := x, property := (_ : List.length x = List.length x) }) (i + j)
  else if j < List.length x then some false else none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (shl x i)) j =   if i + j < n then List.get? (Vector.toList x) (i + j) else if j < n then some false else none
i, j: โ„•

x: List Bool

mk
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j =   if i + j < List.length x then List.get? x (i + j) else if j < List.length x then some false else none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (shl x i)) j =   if i + j < n then List.get? (Vector.toList x) (i + j) else if j < n then some false else none
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = List.get? x (i + j)
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (shl x i)) j =   if i + j < n then List.get? (Vector.toList x) (i + j) else if j < n then some false else none
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = List.get? x (i + j)
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = List.get? x (i + j)
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = List.get? x (i + j)
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
List.get? (List.drop i x) j = List.get? x (i + j)
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
j < List.length (List.drop i x)
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = List.get? x (i + j)
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
List.get? x (i + j) = List.get? x (i + j)
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
j < List.length (List.drop i x)
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
j < List.length (List.drop i x)
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = List.get? x (i + j)
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
j < List.length (List.drop i x)
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
j < List.length (List.drop i x)
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
j < List.length (List.drop i x)
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
j < List.length x - i
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
j < List.length x - i
i, j: โ„•

x: List Bool

hโ‚: i + j < List.length x

mk.inl
j < List.length (List.drop i x)
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (shl x i)) j =   if i + j < n then List.get? (Vector.toList x) (i + j) else if j < n then some false else none
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.replicate (min (List.length x) i) false) (j - List.length (List.drop i x)) = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.length (List.drop i x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
some
    (List.get (List.replicate (min (List.length x) i) false)
      { val := j - List.length (List.drop i x), isLt := ?mk.inr.inl }) =   some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
j - List.length (List.drop i x) < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.length (List.drop i x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
some false = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
j - List.length (List.drop i x) < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
j - List.length (List.drop i x) < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.length (List.drop i x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
j - List.length (List.drop i x) < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
j - List.length (List.drop i x) < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.length (List.drop i x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
j - List.length (List.drop i x) < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
j - List.length (List.drop i x) < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
j - List.length (List.drop i x) < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.length (List.drop i x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
j - List.length (List.drop i x) < List.length (List.replicate (min (List.length x) i) false)
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

List.length (List.drop i x) โ‰ค j
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
j - List.length (List.drop i x) < List.length (List.replicate (min (List.length x) i) false)
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

j < List.length (List.drop i x) + List.length (List.replicate (min (List.length x) i) false)
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.length (List.drop i x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: j < List.length x

mk.inr.inl
List.length (List.drop i x) โ‰ค j
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (shl x i)) j =   if i + j < n then List.get? (Vector.toList x) (i + j) else if j < n then some false else none
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.length (List.drop i x ++ List.replicate (min (List.length x) i) false) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.length (List.drop i x ++ List.replicate (min (List.length x) i) false) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌi + j < List.length x

hโ‚‚: ยฌj < List.length x

mk.inr.inr
List.get? (List.drop i x ++ List.replicate (min (List.length x) i) false) j = none
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™

  
theorem 
get?_ushr: โˆ€ {n : โ„•} (x : Bitvec n) (i j : โ„•),
  List.get? (Vector.toList (ushr x i)) j =     if j < Vector.length x then if j < i then some false else List.get? (Vector.toList x) (j - i) else none
get?_ushr (
x: Bitvec n
x : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.243301
n) (
i: โ„•
i 
j: โ„•
j : 
โ„•: Type
โ„•) : 
    (
x: Bitvec n
x.
ushr: {n : โ„•} โ†’ Bitvec n โ†’ โ„• โ†’ Bitvec n
ushr 
i: โ„•
i).
toList: {ฮฑ : Type ?u.243316} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList.
get?: {ฮฑ : Type ?u.243321} โ†’ List ฮฑ โ†’ โ„• โ†’ Option ฮฑ
get? 
j: โ„•
j = 
      if 
j: โ„•
j < 
x: Bitvec n
x.
length: {ฮฑ : Type ?u.243328} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ โ„•
length
      then if 
j: โ„•
j < 
i: โ„•
i
        then 
some: {ฮฑ : Type ?u.243361} โ†’ ฮฑ โ†’ Option ฮฑ
some 
false: Bool
false
        else 
x: Bitvec n
x.
toList: {ฮฑ : Type ?u.243364} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList.
get?: {ฮฑ : Type ?u.243367} โ†’ List ฮฑ โ†’ โ„• โ†’ Option ฮฑ
get? (
j: โ„•
j - 
i: โ„•
i)
      else 
none: {ฮฑ : Type ?u.243414} โ†’ Option ฮฑ
none := 
Goals accomplished! ๐Ÿ™
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (ushr x i)) j =   if j < Vector.length x then if j < i then some false else List.get? (Vector.toList x) (j - i) else none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (fillShr x i false)) j =   if j < Vector.length x then if j < i then some false else List.get? (Vector.toList x) (j - i) else none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (ushr x i)) j =   if j < Vector.length x then if j < i then some false else List.get? (Vector.toList x) (j - i) else none
i, j: โ„•

x: List Bool

mk
List.get? (Vector.toList (fillShr { val := x, property := (_ : List.length x = List.length x) } i false)) j =   if j < Vector.length { val := x, property := (_ : List.length x = List.length x) } then
    if j < i then some false
    else List.get? (Vector.toList { val := x, property := (_ : List.length x = List.length x) }) (j - i)
  else none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (ushr x i)) j =   if j < Vector.length x then if j < i then some false else List.get? (Vector.toList x) (j - i) else none
i, j: โ„•

x: List Bool

mk
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j =   if j < Vector.length { val := x, property := (_ : List.length x = List.length x) } then
    if j < i then some false else List.get? x (j - i)
  else none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (ushr x i)) j =   if j < Vector.length x then if j < i then some false else List.get? (Vector.toList x) (j - i) else none
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = some false
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (ushr x i)) j =   if j < Vector.length x then if j < i then some false else List.get? (Vector.toList x) (j - i) else none
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = some false
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = some false
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = some false
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
List.get? (List.replicate (min (List.length x) i) false) j = some false
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = some false
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
some (List.get (List.replicate (min (List.length x) i) false) { val := j, isLt := ?mk.inl.inl }) = some false
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = some false
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
some false = some false
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = some false
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = some false
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: j < i

mk.inl.inl
j < List.length (List.replicate (min (List.length x) i) false)
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (ushr x i)) j =   if j < Vector.length x then if j < i then some false else List.get? (Vector.toList x) (j - i) else none
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.get? (List.replicate i false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.get? (List.take (List.length x - i) x) (j - List.length (List.replicate i false)) = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.length (List.replicate i false) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.get? x (j - List.length (List.replicate i false)) = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
j - List.length (List.replicate i false) < List.length x - i
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.length (List.replicate i false) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.get? x (j - List.length (List.replicate i false)) = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
j - List.length (List.replicate i false) < List.length x - i
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.length (List.replicate i false) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
j - List.length (List.replicate i false) < List.length x - i
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.length (List.replicate i false) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
j - List.length (List.replicate i false) < List.length x - i
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
j - List.length (List.replicate i false) < List.length x - i
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.length (List.replicate i false) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
j - List.length (List.replicate i false) < List.length x - i
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

List.length (List.replicate i false) โ‰ค j
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
j - List.length (List.replicate i false) < List.length x - i
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

j < List.length (List.replicate i false) + (List.length x - i)
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

mk.inl.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = List.get? x (j - i)
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.length (List.replicate i false) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: j < Vector.length { val := x, property := (_ : List.length x = List.length x) }

hโ‚‚: ยฌj < i

this: i < List.length x

mk.inl.inr
List.length (List.replicate i false) โ‰ค j
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
n: โ„•

x: Bitvec n

i, j: โ„•

List.get? (Vector.toList (ushr x i)) j =   if j < Vector.length x then if j < i then some false else List.get? (Vector.toList x) (j - i) else none
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.length (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.length (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.get? (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) j = none
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.length (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.length (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.length (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.length (List.replicate (if List.length x โ‰ค i then List.length x else i) false ++ List.take (List.length x - i) x) โ‰ค   j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.length (List.replicate (if List.length x โ‰ค i then List.length x else i) false ++ List.take (List.length x - i) x) โ‰ค   j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.length (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

h: List.length x โ‰ค i

mk.inr.inl
List.length (List.replicate (List.length x) false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

h: ยฌList.length x โ‰ค i

mk.inr.inr
List.length (List.replicate i false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.length (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

h: List.length x โ‰ค i

mk.inr.inl
List.length (List.replicate (List.length x) false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

h: List.length x โ‰ค i

mk.inr.inl
List.length (List.replicate (List.length x) false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

h: ยฌList.length x โ‰ค i

mk.inr.inr
List.length (List.replicate i false ++ List.take (List.length x - i) x) โ‰ค j
Goals accomplished! ๐Ÿ™
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

h: ยฌList.length x โ‰ค i

mk.inr.inr
List.length (List.replicate i false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

mk.inr
List.length (List.replicate (min (List.length x) i) false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

h: ยฌList.length x โ‰ค i

mk.inr.inr
List.length (List.replicate i false ++ List.take (List.length x - i) x) โ‰ค j
i, j: โ„•

x: List Bool

hโ‚: ยฌj < Vector.length { val := x, property := (_ : List.length x = List.length x) }

h: ยฌList.length x โ‰ค i

mk.inr.inr
List.length (List.replicate i false ++ List.take (List.length x - i) x) โ‰ค j
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™


theorem 
get?_and: โˆ€ {n : โ„•} (x y : Bitvec n) (i : โ„•),
  List.get? (Vector.toList (Bitvec.and x y)) i = do
    let __do_lift โ† List.get? (Vector.toList x) i
    let __do_lift_1 โ† List.get? (Vector.toList y) i
    pure (__do_lift && __do_lift_1)
get?_and (
x: Bitvec n
x 
y: Bitvec n
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
n: ?m.261838
n) (
i: โ„•
i : 
โ„•: Type
โ„•) : 
    (
x: Bitvec n
x.
and: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Bitvec n
and 
y: Bitvec n
y).
toList: {ฮฑ : Type ?u.261853} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList.
get?: {ฮฑ : Type ?u.261858} โ†’ List ฮฑ โ†’ โ„• โ†’ Option ฮฑ
get? 
i: โ„•
i = do return 
(โ† x.toList.get? i): ?m.261941
(โ† 
x: Bitvec n
x
(โ† x.toList.get? i): ?m.261941
.
toList: {ฮฑ : Type ?u.261931} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList
(โ† x.toList.get? i): ?m.261941
.
get?: {ฮฑ : Type ?u.261934} โ†’ List ฮฑ โ†’ โ„• โ†’ Option ฮฑ
get?
(โ† x.toList.get? i): ?m.261941
 
i: โ„•
i
(โ† x.toList.get? i): ?m.261941
) && 
(โ† y.toList.get? i): ?m.261997
(โ† 
y: Bitvec n
y
(โ† y.toList.get? i): ?m.261997
.
toList: {ฮฑ : Type ?u.261988} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList
(โ† y.toList.get? i): ?m.261997
.
get?: {ฮฑ : Type ?u.261991} โ†’ List ฮฑ โ†’ โ„• โ†’ Option ฮฑ
get?
(โ† y.toList.get? i): ?m.261997
 
i: โ„•
i
(โ† y.toList.get? i): ?m.261997
) := 
Goals accomplished! ๐Ÿ™
n: โ„•

x, y: Bitvec n

i: โ„•

List.get? (Vector.toList (Bitvec.and x y)) i = do
  let __do_lift โ† List.get? (Vector.toList x) i
  let __do_lift_1 โ† List.get? (Vector.toList y) i
  pure (__do_lift && __do_lift_1)
i: โ„•

x: List Bool

y: Bitvec (List.length x)

mk
List.get? (Vector.toList (Bitvec.and { val := x, property := (_ : List.length x = List.length x) } y)) i = do
  let __do_lift โ† List.get? (Vector.toList { val := x, property := (_ : List.length x = List.length x) }) i
  let __do_lift_1 โ† List.get? (Vector.toList y) i
  pure (__do_lift && __do_lift_1)
n: โ„•

x, y: Bitvec n

i: โ„•

List.get? (Vector.toList (Bitvec.and x y)) i = do
  let __do_lift โ† List.get? (Vector.toList x) i
  let __do_lift_1 โ† List.get? (Vector.toList y) i
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

mk.mk
List.get?
    (Vector.toList
      (Bitvec.and { val := x, property := (_ : List.length x = List.length x) } { val := y, property := hy }))
    i =   do
  let __do_lift โ† List.get? (Vector.toList { val := x, property := (_ : List.length x = List.length x) }) i
  let __do_lift_1 โ† List.get? (Vector.toList { val := y, property := hy }) i
  pure (__do_lift && __do_lift_1)
n: โ„•

x, y: Bitvec n

i: โ„•

List.get? (Vector.toList (Bitvec.and x y)) i = do
  let __do_lift โ† List.get? (Vector.toList x) i
  let __do_lift_1 โ† List.get? (Vector.toList y) i
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

mk.mk
(Option.bind (Option.map and (List.get? x i)) fun g => Option.map g (List.get? y i)) = do
  let __do_lift โ† List.get? x i
  let __do_lift_1 โ† List.get? y i
  pure (__do_lift && __do_lift_1)
n: โ„•

x, y: Bitvec n

i: โ„•

List.get? (Vector.toList (Bitvec.and x y)) i = do
  let __do_lift โ† List.get? (Vector.toList x) i
  let __do_lift_1 โ† List.get? (Vector.toList y) i
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

mk.mk.none
(Option.bind (Option.map and none) fun g => Option.map g (List.get? y i)) = do
  let __do_lift โ† none
  let __do_lift_1 โ† List.get? y i
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

valโœ: Bool

mk.mk.some
(Option.bind (Option.map and (some valโœ)) fun g => Option.map g (List.get? y i)) = do
  let __do_lift โ† some valโœ
  let __do_lift_1 โ† List.get? y i
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

mk.mk
(Option.bind (Option.map and (List.get? x i)) fun g => Option.map g (List.get? y i)) = do
  let __do_lift โ† List.get? x i
  let __do_lift_1 โ† List.get? y i
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

mk.mk.none
(Option.bind (Option.map and none) fun g => Option.map g (List.get? y i)) = do
  let __do_lift โ† none
  let __do_lift_1 โ† List.get? y i
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

valโœ: Bool

mk.mk.some
(Option.bind (Option.map and (some valโœ)) fun g => Option.map g (List.get? y i)) = do
  let __do_lift โ† some valโœ
  let __do_lift_1 โ† List.get? y i
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

mk.mk
(Option.bind (Option.map and (List.get? x i)) fun g => Option.map g (List.get? y i)) = do
  let __do_lift โ† List.get? x i
  let __do_lift_1 โ† List.get? y i
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

valโœ: Bool

mk.mk.some.none
(Option.bind (Option.map and (some valโœ)) fun g => Option.map g none) = do
  let __do_lift โ† some valโœ
  let __do_lift_1 โ† none
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

valโœยน, valโœ: Bool

mk.mk.some.some
(Option.bind (Option.map and (some valโœยน)) fun g => Option.map g (some valโœ)) = do
  let __do_lift โ† some valโœยน
  let __do_lift_1 โ† some valโœ
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

mk.mk
(Option.bind (Option.map and (List.get? x i)) fun g => Option.map g (List.get? y i)) = do
  let __do_lift โ† List.get? x i
  let __do_lift_1 โ† List.get? y i
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

mk.mk.none.none
(Option.bind (Option.map and none) fun g => Option.map g none) = do
  let __do_lift โ† none
  let __do_lift_1 โ† none
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

valโœ: Bool

mk.mk.none.some
(Option.bind (Option.map and none) fun g => Option.map g (some valโœ)) = do
  let __do_lift โ† none
  let __do_lift_1 โ† some valโœ
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

valโœ: Bool

mk.mk.some.none
(Option.bind (Option.map and (some valโœ)) fun g => Option.map g none) = do
  let __do_lift โ† some valโœ
  let __do_lift_1 โ† none
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

valโœยน, valโœ: Bool

mk.mk.some.some
(Option.bind (Option.map and (some valโœยน)) fun g => Option.map g (some valโœ)) = do
  let __do_lift โ† some valโœยน
  let __do_lift_1 โ† some valโœ
  pure (__do_lift && __do_lift_1)
i: โ„•

x, y: List Bool

hy: List.length y = List.length x

mk.mk
(Option.bind (Option.map and (List.get? x i)) fun g => Option.map g (List.get? y i)) = do
  let __do_lift โ† List.get? x i
  let __do_lift_1 โ† List.get? y i
  pure (__do_lift && __do_lift_1)
Goals accomplished! ๐Ÿ™


theorem 
get?_ofInt_neg_one: โˆ€ {w i : โ„•}, List.get? (Vector.toList (Bitvec.ofInt w (-1))) i = if i โ‰ค w then some true else none
get?_ofInt_neg_one : (
Bitvec.ofInt: (n : โ„•) โ†’ โ„ค โ†’ Bitvec (Nat.succ n)
Bitvec.ofInt 
w: ?m.313195
w (-
1: ?m.313244
1)).
toList: {ฮฑ : Type ?u.313261} โ†’ {n : โ„•} โ†’ Vector ฮฑ n โ†’ List ฮฑ
toList.
get?: {ฮฑ : Type ?u.313264} โ†’ List ฮฑ โ†’ โ„• โ†’ Option ฮฑ
get? 
i: ?m.313238
i = 
    if 
i: ?m.313238
i โ‰ค 
w: ?m.313195
w then 
some: {ฮฑ : Type ?u.313287} โ†’ ฮฑ โ†’ Option ฮฑ
some 
true: Bool
true else 
none: {ฮฑ : Type ?u.313290} โ†’ Option ฮฑ
none := 
Goals accomplished! ๐Ÿ™
w, i: โ„•

List.get? (Vector.toList (Bitvec.ofInt w (-1))) i = if i โ‰ค w then some true else none
w, i: โ„•

List.get? (Vector.toList (true ::แตฅ Bitvec.not (Bitvec.ofNat w 0))) i = if i โ‰ค w then some true else none
w, i: โ„•

List.get? (Vector.toList (Bitvec.ofInt w (-1))) i = if i โ‰ค w then some true else none
w, i: โ„•

List.get? (true :: List.replicate w true) i = if i โ‰ค w then some true else none
w, i: โ„•

List.get? (Vector.toList (Bitvec.ofInt w (-1))) i = if i โ‰ค w then some true else none
w, i: โ„•

List.get? (true :: List.replicate w true) i = if i โ‰ค w then some true else none
w, i: โ„•

List.get? (List.replicate (w + 1) true) i = if i โ‰ค w then some true else none
w, i: โ„•

List.get? (List.replicate (w + 1) true) i = if i โ‰ค w then some true else none
w, i: โ„•

List.get? (Vector.toList (Bitvec.ofInt w (-1))) i = if i โ‰ค w then some true else none
w, i: โ„•

h: i โ‰ค w

inl
List.get? (List.replicate (w + 1) true) i = some true
w, i: โ„•

h: ยฌi โ‰ค w

inr
List.get? (List.replicate (w + 1) true) i = none
w, i: โ„•

List.get? (Vector.toList (Bitvec.ofInt w (-1))) i = if i โ‰ค w then some true else none
w, i: โ„•

h: i โ‰ค w

inl
List.get? (List.replicate (w + 1) true) i = some true
w, i: โ„•

h: i โ‰ค w

inl
List.get? (List.replicate (w + 1) true) i = some true
w, i: โ„•

h: ยฌi โ‰ค w

inr
List.get? (List.replicate (w + 1) true) i = none
w, i: โ„•

h: i โ‰ค w

inl
List.get? (List.replicate (w + 1) true) i = some true
w, i: โ„•

h: i โ‰ค w

inl
some (List.get (List.replicate (w + 1) true) { val := i, isLt := ?inl }) = some true
w, i: โ„•

h: i โ‰ค w

inl
i < List.length (List.replicate (w + 1) true)
w, i: โ„•

h: i โ‰ค w

inl
List.get? (List.replicate (w + 1) true) i = some true
w, i: โ„•

h: i โ‰ค w

inl
some true = some true
w, i: โ„•

h: i โ‰ค w

inl
i < List.length (List.replicate (w + 1) true)
w, i: โ„•

h: i โ‰ค w

inl
i < List.length (List.replicate (w + 1) true)
w, i: โ„•

h: i โ‰ค w

inl
i < List.length (List.replicate (w + 1) true)
w, i: โ„•

h: i โ‰ค w

inl
i < List.length (List.replicate (w + 1) true)
w, i: โ„•

h: i โ‰ค w

inl
List.get? (List.replicate (w + 1) true) i = some true
w, i: โ„•

h: i โ‰ค w

inl
i < List.length (List.replicate (w + 1) true)
w, i: โ„•

h: i โ‰ค w

inl
i < List.length (List.replicate (w + 1) true)
w, i: โ„•

h: i โ‰ค w

inl
List.get? (List.replicate (w + 1) true) i = some true
Goals accomplished! ๐Ÿ™
w, i: โ„•

h: ยฌi โ‰ค w

inr
List.get? (List.replicate (w + 1) true) i = none
w, i: โ„•

List.get? (Vector.toList (Bitvec.ofInt w (-1))) i = if i โ‰ค w then some true else none
w, i: โ„•

h: ยฌi โ‰ค w

inr
List.get? (List.replicate (w + 1) true) i = none
w, i: โ„•

h: ยฌi โ‰ค w

inr
List.get? (List.replicate (w + 1) true) i = none
w, i: โ„•

h: ยฌi โ‰ค w

inr
List.get? (List.replicate (w + 1) true) i = none
w, i: โ„•

h: ยฌi โ‰ค w

inr
List.length (List.replicate (w + 1) true) โ‰ค i
w, i: โ„•

h: ยฌi โ‰ค w

inr
List.length (List.replicate (w + 1) true) โ‰ค i
w, i: โ„•

h: ยฌi โ‰ค w

inr
List.get? (List.replicate (w + 1) true) i = none
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™


-- from InstCombine/Shift:279
theorem 
shl_ushr_eq_and_shl: โˆ€ {w : โ„•} {x C : Bitvec (Nat.succ w)},
  shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C) = Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))
shl_ushr_eq_and_shl {
w: โ„•
w : 
Nat: Type
Nat} {
x: Bitvec (Nat.succ w)
x 
C: Bitvec (Nat.succ w)
C : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w.
succ: โ„• โ†’ โ„•
succ} :
    
Bitvec.shl: {n : โ„•} โ†’ Bitvec n โ†’ โ„• โ†’ Bitvec n
Bitvec.shl (
Bitvec.ushr: {n : โ„•} โ†’ Bitvec n โ†’ โ„• โ†’ Bitvec n
Bitvec.ushr 
x: Bitvec (Nat.succ w)
x 
C: Bitvec (Nat.succ w)
C.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat) 
C: Bitvec (Nat.succ w)
C.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat = 
Bitvec.and: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Bitvec n
Bitvec.and 
x: Bitvec (Nat.succ w)
x (
Bitvec.shl: {n : โ„•} โ†’ Bitvec n โ†’ โ„• โ†’ Bitvec n
Bitvec.shl (
Bitvec.ofInt: (n : โ„•) โ†’ โ„ค โ†’ Bitvec (Nat.succ n)
Bitvec.ofInt 
w: โ„•
w (-
1: ?m.315986
1)) 
C: Bitvec (Nat.succ w)
C.
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat) := 
Goals accomplished! ๐Ÿ™
w: โ„•

x, C: Bitvec (Nat.succ w)

shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C) = Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))
w: โ„•

x, C: Bitvec (Nat.succ w)

h
โˆ€ (i : โ„•),
  List.get? (Vector.toList (shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C))) i =     List.get? (Vector.toList (Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C)))) i
w: โ„•

x, C: Bitvec (Nat.succ w)

shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C) = Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

h
List.get? (Vector.toList (shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C))) i =   List.get? (Vector.toList (Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C)))) i
w: โ„•

x, C: Bitvec (Nat.succ w)

shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C) = Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

h
List.get? (Vector.toList (shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C))) i =   List.get? (Vector.toList (Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C)))) i
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

h
(if Bitvec.toNat C + i < Nat.succ w then List.get? (Vector.toList (ushr x (Bitvec.toNat C))) (Bitvec.toNat C + i)
  else if i < Nat.succ w then some false else none) =   List.get? (Vector.toList (Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C)))) i
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

h
List.get? (Vector.toList (shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C))) i =   List.get? (Vector.toList (Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C)))) i
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

h
(if Bitvec.toNat C + i < Nat.succ w then
    if Bitvec.toNat C + i < Vector.length x then
      if Bitvec.toNat C + i < Bitvec.toNat C then some false
      else List.get? (Vector.toList x) (Bitvec.toNat C + i - Bitvec.toNat C)
    else none
  else if i < Nat.succ w then some false else none) =   List.get? (Vector.toList (Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C)))) i
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

h
List.get? (Vector.toList (shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C))) i =   List.get? (Vector.toList (Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C)))) i
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

h
(if Bitvec.toNat C + i < Nat.succ w then
    if Bitvec.toNat C + i < Vector.length x then
      if Bitvec.toNat C + i < Bitvec.toNat C then some false
      else List.get? (Vector.toList x) (Bitvec.toNat C + i - Bitvec.toNat C)
    else none
  else if i < Nat.succ w then some false else none) =   do
  let __do_lift โ† List.get? (Vector.toList x) i
  let __do_lift_1 โ† List.get? (Vector.toList (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))) i
  pure (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

h
(if Bitvec.toNat C + i < Nat.succ w then
    if Bitvec.toNat C + i < Vector.length x then
      if Bitvec.toNat C + i < Bitvec.toNat C then some false
      else List.get? (Vector.toList x) (Bitvec.toNat C + i - Bitvec.toNat C)
    else none
  else if i < Nat.succ w then some false else none) =   do
  let __do_lift โ† List.get? (Vector.toList x) i
  let __do_lift_1 โ† List.get? (Vector.toList (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))) i
  pure (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C) = Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

h
(if Bitvec.toNat C + i โ‰ค w then
    if Bitvec.toNat C + i โ‰ค w then
      if Bitvec.toNat C + i < Bitvec.toNat C then some false
      else List.get? (Vector.toList x) (Bitvec.toNat C + i - Bitvec.toNat C)
    else none
  else if i โ‰ค w then some false else none) =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind
      (if Bitvec.toNat C + i โ‰ค w then if Bitvec.toNat C + i โ‰ค w then some true else none
      else if i โ‰ค w then some false else none)
      fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C) = Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: Bitvec.toNat C + i โ‰ค w

hโ‚‚: Bitvec.toNat C + i < Bitvec.toNat C

h.inl.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some true) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: Bitvec.toNat C + i โ‰ค w

hโ‚‚: ยฌBitvec.toNat C + i < Bitvec.toNat C

h.inl.inr
List.get? (Vector.toList x) (Bitvec.toNat C + i - Bitvec.toNat C) =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some true) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C) = Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: Bitvec.toNat C + i โ‰ค w

hโ‚‚: Bitvec.toNat C + i < Bitvec.toNat C

h.inl.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some true) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: Bitvec.toNat C + i โ‰ค w

hโ‚‚: Bitvec.toNat C + i < Bitvec.toNat C

h.inl.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some true) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: Bitvec.toNat C + i โ‰ค w

hโ‚‚: ยฌBitvec.toNat C + i < Bitvec.toNat C

h.inl.inr
List.get? (Vector.toList x) (Bitvec.toNat C + i - Bitvec.toNat C) =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some true) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
Goals accomplished! ๐Ÿ™
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: Bitvec.toNat C + i โ‰ค w

hโ‚‚: ยฌBitvec.toNat C + i < Bitvec.toNat C

h.inl.inr
List.get? (Vector.toList x) (Bitvec.toNat C + i - Bitvec.toNat C) =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some true) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C) = Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: Bitvec.toNat C + i โ‰ค w

hโ‚‚: ยฌBitvec.toNat C + i < Bitvec.toNat C

h.inl.inr
List.get? (Vector.toList x) (Bitvec.toNat C + i - Bitvec.toNat C) =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some true) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: Bitvec.toNat C + i โ‰ค w

hโ‚‚: ยฌBitvec.toNat C + i < Bitvec.toNat C

h.inl.inr
List.get? (Vector.toList x) (Bitvec.toNat C + i - Bitvec.toNat C) =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some true) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
Goals accomplished! ๐Ÿ™
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C) = Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (some (List.get (Vector.toList x) { val := i, isLt := ?h.inr.inl })) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
i < List.length (Vector.toList x)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (some (List.get (Vector.toList x) { val := i, isLt := ?h.inr.inl })) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
i < List.length (Vector.toList x)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (some (List.get (Vector.toList x) { val := i, isLt := ?h.inr.inl })) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
i < List.length (Vector.toList x)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: i โ‰ค w

h.inr.inl
some false =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind (some false) fun __do_lift_1 => some (__do_lift && __do_lift_1)
Goals accomplished! ๐Ÿ™
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

shl (ushr x (Bitvec.toNat C)) (Bitvec.toNat C) = Bitvec.and x (shl (Bitvec.ofInt w (-1)) (Bitvec.toNat C))
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none = Option.bind none fun __do_lift => Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
List.length (Vector.toList x) โ‰ค i
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none = Option.bind none fun __do_lift => Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
List.length (Vector.toList x) โ‰ค i
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none = Option.bind none fun __do_lift => Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
List.length (Vector.toList x) โ‰ค i
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
Goals accomplished! ๐Ÿ™
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: w < Bitvec.toNat C + i

hโ‚ƒ: w < i

h.inr.inr
w < i
w: โ„•

x, C: Bitvec (Nat.succ w)

i: โ„•

hโ‚: ยฌBitvec.toNat C + i โ‰ค w

hโ‚ƒ: ยฌi โ‰ค w

h.inr.inr
none =   Option.bind (List.get? (Vector.toList x) i) fun __do_lift =>
    Option.bind none fun __do_lift_1 => some (__do_lift && __do_lift_1)
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™


-- A lot of this should probably go to a differet file here and not Mathlib
inductive 
Refinement: {ฮฑ : Type u} โ†’ Option ฮฑ โ†’ Option ฮฑ โ†’ Prop
Refinement {
ฮฑ: Type u
ฮฑ : 
Type u: Type (u+1)
Type u} : 
Option: Type ?u.331572 โ†’ Type ?u.331572
Option 
ฮฑ: Type u
ฮฑ โ†’ 
Option: Type ?u.331575 โ†’ Type ?u.331575
Option 
ฮฑ: Type u
ฮฑ โ†’ 
Prop: Type
Prop
  | 
bothSome: โˆ€ {ฮฑ : Type u} {x y : ฮฑ}, x = y โ†’ Refinement (some x) (some y)
bothSome {
x: ฮฑ
x 
y: ฮฑ
y : 
ฮฑ: Type u
ฮฑ } : 
x: ฮฑ
x = 
y: ฮฑ
y โ†’ 
Refinement: {ฮฑ : Type u} โ†’ Option ฮฑ โ†’ Option ฮฑ โ†’ Prop
Refinement (
some: {ฮฑ : Type ?u.331591} โ†’ ฮฑ โ†’ Option ฮฑ
some 
x: ฮฑ
x) (
some: {ฮฑ : Type ?u.331594} โ†’ ฮฑ โ†’ Option ฮฑ
some 
y: ฮฑ
y)
  | 
noneAny: โˆ€ {ฮฑ : Type u} {x? : Option ฮฑ}, Refinement none x?
noneAny {
x?: Option ฮฑ
x? : 
Option: Type ?u.331602 โ†’ Type ?u.331602
Option 
ฮฑ: Type u
ฮฑ} : 
Refinement: {ฮฑ : Type u} โ†’ Option ฮฑ โ†’ Option ฮฑ โ†’ Prop
Refinement 
none: {ฮฑ : Type ?u.331606} โ†’ Option ฮฑ
none 
x?: Option ฮฑ
x?

namespace Refinement

theorem 
Refinement.refl: โˆ€ {ฮฑ : Type u} (x : Option ฮฑ), Refinement x x
Refinement.refl {
ฮฑ: Type u
ฮฑ: 
Type u: Type (u+1)
Type u} : โˆ€ 
x: Option ฮฑ
x : 
Option: Type ?u.331639 โ†’ Type ?u.331639
Option 
ฮฑ: Type u
ฮฑ, 
Refinement: {ฮฑ : Type ?u.331642} โ†’ Option ฮฑ โ†’ Option ฮฑ โ†’ Prop
Refinement 
x: Option ฮฑ
x 
x: Option ฮฑ
x := 
Goals accomplished! ๐Ÿ™
ฮฑ: Type u

โˆ€ (x : Option ฮฑ), Refinement x x
ฮฑ: Type u

x: Option ฮฑ

Refinement x x
ฮฑ: Type u

โˆ€ (x : Option ฮฑ), Refinement x x
ฮฑ: Type u

x: Option ฮฑ

Refinement x x
ฮฑ: Type u

โˆ€ (x : Option ฮฑ), Refinement x x
ฮฑ: Type u

none
Refinement none none
ฮฑ: Type u

valโœ: ฮฑ

some
Refinement (some valโœ) (some valโœ)
ฮฑ: Type u

โˆ€ (x : Option ฮฑ), Refinement x x
ฮฑ: Type u

valโœ: ฮฑ

some
Refinement (some valโœ) (some valโœ)
ฮฑ: Type u

โˆ€ (x : Option ฮฑ), Refinement x x
ฮฑ: Type u

valโœ: ฮฑ

some.a
valโœ = valโœ
ฮฑ: Type u

valโœ: ฮฑ

some.a
valโœ = valโœ
ฮฑ: Type u

โˆ€ (x : Option ฮฑ), Refinement x x
Goals accomplished! ๐Ÿ™


theorem 
Refinement.trans: โˆ€ {ฮฑ : Type u} (x y z : Option ฮฑ), Refinement x y โ†’ Refinement y z โ†’ Refinement x z
Refinement.trans {
ฮฑ: Type u
ฮฑ : 
Type u: Type (u+1)
Type u} : โˆ€ 
x: Option ฮฑ
x 
y: Option ฮฑ
y 
z: Option ฮฑ
z : 
Option: Type ?u.331753 โ†’ Type ?u.331753
Option 
ฮฑ: Type u
ฮฑ, 
Refinement: {ฮฑ : Type ?u.331757} โ†’ Option ฮฑ โ†’ Option ฮฑ โ†’ Prop
Refinement 
x: Option ฮฑ
x 
y: Option ฮฑ
y โ†’ 
Refinement: {ฮฑ : Type ?u.331763} โ†’ Option ฮฑ โ†’ Option ฮฑ โ†’ Prop
Refinement 
y: Option ฮฑ
y 
z: Option ฮฑ
z โ†’ 
Refinement: {ฮฑ : Type ?u.331767} โ†’ Option ฮฑ โ†’ Option ฮฑ โ†’ Prop
Refinement 
x: Option ฮฑ
x 
z: Option ฮฑ
z := 
Goals accomplished! ๐Ÿ™
ฮฑ: Type u

โˆ€ (x y z : Option ฮฑ), Refinement x y โ†’ Refinement y z โ†’ Refinement x z
ฮฑ: Type u

x, y, z: Option ฮฑ

hโ‚: Refinement x y

hโ‚‚: Refinement y z

Refinement x z
ฮฑ: Type u

โˆ€ (x y z : Option ฮฑ), Refinement x y โ†’ Refinement y z โ†’ Refinement x z
ฮฑ: Type u

z: Option ฮฑ

xโœ, yโœ: ฮฑ

aโœ: xโœ = yโœ

hโ‚‚: Refinement (some yโœ) z

bothSome
Refinement (some xโœ) z
ฮฑ: Type u

y, z: Option ฮฑ

hโ‚‚: Refinement y z

noneAny
Refinement none z
ฮฑ: Type u

x, y, z: Option ฮฑ

hโ‚: Refinement x y

hโ‚‚: Refinement y z

Refinement x z
ฮฑ: Type u

z: Option ฮฑ

xโœ, yโœ: ฮฑ

aโœ: xโœ = yโœ

hโ‚‚: Refinement (some yโœ) z

bothSome
Refinement (some xโœ) z
ฮฑ: Type u

y, z: Option ฮฑ

hโ‚‚: Refinement y z

noneAny
Refinement none z
ฮฑ: Type u

x, y, z: Option ฮฑ

hโ‚: Refinement x y

hโ‚‚: Refinement y z

Refinement x z
ฮฑ: Type u

xโœ, yโœ: ฮฑ

aโœ: xโœ = yโœ

noneAny.bothSome
Refinement none (some yโœ)
ฮฑ: Type u

z: Option ฮฑ

noneAny.noneAny
Refinement none z
ฮฑ: Type u

x, y, z: Option ฮฑ

hโ‚: Refinement x y

hโ‚‚: Refinement y z

Refinement x z
ฮฑ: Type u

xโœ, yโœยน: ฮฑ

aโœยน: xโœ = yโœยน

yโœ: ฮฑ

aโœ: yโœยน = yโœ

bothSome.bothSome
Refinement (some xโœ) (some yโœ)
ฮฑ: Type u

xโœ, yโœ: ฮฑ

aโœ: xโœ = yโœ

noneAny.bothSome
Refinement none (some yโœ)
ฮฑ: Type u

z: Option ฮฑ

noneAny.noneAny
Refinement none z
ฮฑ: Type u

x, y, z: Option ฮฑ

hโ‚: Refinement x y

hโ‚‚: Refinement y z

Refinement x z
ฮฑ: Type u

z: Option ฮฑ

noneAny.noneAny
Refinement none z
ฮฑ: Type u

z: Option ฮฑ

noneAny.noneAny
Refinement none z
ฮฑ: Type u

z: Option ฮฑ

noneAny.noneAny
Refinement none z
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™
ฮฑ: Type u

โˆ€ (x y z : Option ฮฑ), Refinement x y โ†’ Refinement y z โ†’ Refinement x z
ฮฑ: Type u

xโœ, yโœยน: ฮฑ

aโœยน: xโœ = yโœยน

yโœ: ฮฑ

aโœ: yโœยน = yโœ

bothSome.bothSome
Refinement (some xโœ) (some yโœ)
ฮฑ: Type u

โˆ€ (x y z : Option ฮฑ), Refinement x y โ†’ Refinement y z โ†’ Refinement x z
ฮฑ: Type u

xโœ, yโœยน: ฮฑ

aโœยน: xโœ = yโœยน

yโœ: ฮฑ

aโœ: yโœยน = yโœ

bothSome.bothSome
Refinement (some xโœ) (some yโœ)
ฮฑ: Type u

xโœ, yโœยน: ฮฑ

aโœยน: xโœ = yโœยน

yโœ: ฮฑ

aโœ: yโœยน = yโœ

bothSome.bothSome
Refinement (some xโœ) (some yโœ)
ฮฑ: Type u

xโœ, yโœยน: ฮฑ

aโœยน: xโœ = yโœยน

yโœ: ฮฑ

aโœ: yโœยน = yโœ

bothSome.bothSome.a
xโœ = yโœ
ฮฑ: Type u

xโœ, yโœยน: ฮฑ

aโœยน: xโœ = yโœยน

yโœ: ฮฑ

aโœ: yโœยน = yโœ

bothSome.bothSome.a
xโœ = yโœ
ฮฑ: Type u

xโœ, yโœยน: ฮฑ

aโœยน: xโœ = yโœยน

yโœ: ฮฑ

aโœ: yโœยน = yโœ

bothSome.bothSome
Refinement (some xโœ) (some yโœ)
ฮฑ: Type u

xโœ, yโœยน: ฮฑ

aโœยน: xโœ = yโœยน

yโœ: ฮฑ

aโœ: yโœยน = yโœ

bothSome.bothSome.a
xโœ = yโœ
ฮฑ: Type u

xโœ, yโœยน: ฮฑ

aโœยน: xโœ = yโœยน

yโœ: ฮฑ

aโœ: yโœยน = yโœ

bothSome.bothSome.a
xโœ = yโœ
ฮฑ: Type u

โˆ€ (x y z : Option ฮฑ), Refinement x y โ†’ Refinement y z โ†’ Refinement x z
ฮฑ: Type u

x, yโœ: ฮฑ

hxy: x = yโœ

y: ฮฑ

h: yโœ = y

bothSome.bothSome
Refinement (some x) (some y)
ฮฑ: Type u

โˆ€ (x y z : Option ฮฑ), Refinement x y โ†’ Refinement y z โ†’ Refinement x z
ฮฑ: Type u

x, yโœ: ฮฑ

hxy: x = yโœ

y: ฮฑ

h: yโœ = y

bothSome.bothSome
Refinement (some x) (some y)
ฮฑ: Type u

x, yโœ: ฮฑ

hxy: x = yโœ

y: ฮฑ

h: yโœ = y

bothSome.bothSome
Refinement (some yโœ) (some y)
ฮฑ: Type u

x, yโœ: ฮฑ

hxy: x = yโœ

y: ฮฑ

h: yโœ = y

bothSome.bothSome
Refinement (some x) (some y)
ฮฑ: Type u

x, yโœ: ฮฑ

hxy: x = yโœ

y: ฮฑ

h: yโœ = y

bothSome.bothSome
Refinement (some y) (some y)
ฮฑ: Type u

x, yโœ: ฮฑ

hxy: x = yโœ

y: ฮฑ

h: yโœ = y

bothSome.bothSome
Refinement (some y) (some y)
ฮฑ: Type u

x, yโœ: ฮฑ

hxy: x = yโœ

y: ฮฑ

h: yโœ = y

bothSome.bothSome
Refinement (some y) (some y)
ฮฑ: Type u

โˆ€ (x y z : Option ฮฑ), Refinement x y โ†’ Refinement y z โ†’ Refinement x z
Goals accomplished! ๐Ÿ™



instance: {ฮฑ : Type u} โ†’ [inst : DecidableEq ฮฑ] โ†’ DecidableRel Refinement
instance {
ฮฑ: Type u
ฮฑ : 
Type u: Type (u+1)
Type u} [
DecidableEq: Sort ?u.332407 โ†’ Sort (max1?u.332407)
DecidableEq 
ฮฑ: Type u
ฮฑ] : 
DecidableRel: {ฮฑ : Sort ?u.332416} โ†’ (ฮฑ โ†’ ฮฑ โ†’ Prop) โ†’ Sort (max1?u.332416)
DecidableRel (@
Refinement: {ฮฑ : Type ?u.332418} โ†’ Option ฮฑ โ†’ Option ฮฑ โ†’ Prop
Refinement 
ฮฑ: Type u
ฮฑ) := 
Goals accomplished! ๐Ÿ™
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

DecidableRel Refinement
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

x, y: Option ฮฑ

Decidable (Refinement x y)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

DecidableRel Refinement
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

y: Option ฮฑ

none
Decidable (Refinement none y)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

y: Option ฮฑ

valโœ: ฮฑ

some
Decidable (Refinement (some valโœ) y)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

x, y: Option ฮฑ

Decidable (Refinement x y)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

y: Option ฮฑ

none
Decidable (Refinement none y)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

y: Option ฮฑ

valโœ: ฮฑ

some
Decidable (Refinement (some valโœ) y)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

x, y: Option ฮฑ

Decidable (Refinement x y)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none
Decidable (Refinement (some valโœ) none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

DecidableRel Refinement
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

none.none
Decidable (Refinement none none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

none.none
Decidable (Refinement none none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

none.some
Decidable (Refinement none (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none
Decidable (Refinement (some valโœ) none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

none.none.h
Refinement none none
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

none.none.h
Refinement none none
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

none.none
Decidable (Refinement none none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

none.some
Decidable (Refinement none (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none
Decidable (Refinement (some valโœ) none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
Goals accomplished! ๐Ÿ™
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

none.some
Decidable (Refinement none (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none
Decidable (Refinement (some valโœ) none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

DecidableRel Refinement
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

none.some
Decidable (Refinement none (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

none.some
Decidable (Refinement none (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none
Decidable (Refinement (some valโœ) none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

none.some.h
Refinement none (some valโœ)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

none.some.h
Refinement none (some valโœ)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

none.some
Decidable (Refinement none (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none
Decidable (Refinement (some valโœ) none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
Goals accomplished! ๐Ÿ™
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none
Decidable (Refinement (some valโœ) none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

DecidableRel Refinement
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none
Decidable (Refinement (some valโœ) none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none
Decidable (Refinement (some valโœ) none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none.h
ยฌRefinement (some valโœ) none
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none.h
ยฌRefinement (some valโœ) none
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none
Decidable (Refinement (some valโœ) none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

h: Refinement (some valโœ) none

some.none.h
False
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

h: Refinement (some valโœ) none

some.none.h
False
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœ: ฮฑ

some.none
Decidable (Refinement (some valโœ) none)
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
Goals accomplished! ๐Ÿ™
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

DecidableRel Refinement
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

some.some
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

some.some.isFalse
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

some.some.isFalse
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

some.some.isFalse
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

some.some.isFalse.h
ยฌRefinement (some val) (some val')
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

some.some.isFalse.h
ยฌRefinement (some val) (some val')
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

some.some.isFalse
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

h: Refinement (some val) (some val')

some.some.isFalse.h
False
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

h: Refinement (some val) (some val')

some.some.isFalse.h
False
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

some.some.isFalse
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

aโœ: val = val'

some.some.isFalse.h.bothSome
False
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

aโœ: val = val'

some.some.isFalse.h.bothSome
False
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: ยฌval = val'

some.some.isFalse
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue
Decidable (Refinement (some val) (some val'))
Goals accomplished! ๐Ÿ™
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

valโœยน, valโœ: ฮฑ

some.some
Decidable (Refinement (some valโœยน) (some valโœ))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue.h
Refinement (some val) (some val')
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue.h
Refinement (some val) (some val')
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue
Decidable (Refinement (some val) (some val'))
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue.h.a
val = val'
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue.h.a
val = val'
ฮฑ: Type u

instโœ: DecidableEq ฮฑ

val, val': ฮฑ

hโœ: val = val'

some.some.isTrue
Decidable (Refinement (some val) (some val'))
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™


end Refinement

infix:50 " โŠ‘ " => 
Refinement: {ฮฑ : Type u} โ†’ Option ฮฑ โ†’ Option ฮฑ โ†’ Prop
Refinement


instance: {w : โ„•} โ†’ DecidableEq (Bitvec w)
instance {
w: โ„•
w : 
Nat: Type
Nat} : 
DecidableEq: Sort ?u.341309 โ†’ Sort (max1?u.341309)
DecidableEq (
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w) := 
inferInstance: {ฮฑ : Sort ?u.341315} โ†’ [i : ฮฑ] โ†’ ฮฑ
inferInstance

theorem 
toInt_injective: โˆ€ {w : โ„•}, Function.Injective Bitvec.toInt
toInt_injective : โˆ€ {
w: โ„•
w : 
Nat: Type
Nat}, 
Function.Injective: {ฮฑ : Sort ?u.341544} โ†’ {ฮฒ : Sort ?u.341543} โ†’ (ฮฑ โ†’ ฮฒ) โ†’ Prop
Function.Injective (
Bitvec.toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
Bitvec.toInt : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w โ†’ 
โ„ค: Type
โ„ค)
  | 
0: โ„•
0, โŸจ[], 
_: List.length [] = 0
_โŸฉ, โŸจ[], _โŸฉ, 
rfl: โˆ€ {ฮฑ : Sort ?u.341577} {a : ฮฑ}, a = a
rfl => 
rfl: โˆ€ {ฮฑ : Sort ?u.341672} {a : ฮฑ}, a = a
rfl
  | 
n: โ„•
n+
1: โ„•
1, โŸจ
a: Bool
a::
x: List Bool
x, 
hx: List.length (a :: x) = n + 1
hxโŸฉ, โŸจ
b: Bool
b::
y: List Bool
y, 
hy: List.length (b :: y) = n + 1
hyโŸฉ, 
h: Bitvec.toInt { val := a :: x, property := hx } = Bitvec.toInt { val := b :: y, property := hy }
h => 
Goals accomplished! ๐Ÿ™
n: โ„•

a: Bool

x: List Bool

hx: List.length (a :: x) = n + 1

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

h: Bitvec.toInt { val := a :: x, property := hx } = Bitvec.toInt { val := b :: y, property := hy }

{ val := a :: x, property := hx } = { val := b :: y, property := hy }
n: โ„•

a: Bool

x: List Bool

hx: List.length (a :: x) = n + 1

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

h: (bif a then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := a :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := a :: x, property := hx }))) =   bif b then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := b :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := b :: y, property := hy }))

{ val := a :: x, property := hx } = { val := b :: y, property := hy }
n: โ„•

a: Bool

x: List Bool

hx: List.length (a :: x) = n + 1

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

h: Bitvec.toInt { val := a :: x, property := hx } = Bitvec.toInt { val := b :: y, property := hy }

{ val := a :: x, property := hx } = { val := b :: y, property := hy }
n: โ„•

a: Bool

x: List Bool

hx: List.length (a :: x) = n + 1

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

h: (bif a then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := a :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := a :: x, property := hx }))) =   bif b then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := b :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := b :: y, property := hy }))

a
Vector.toList { val := a :: x, property := hx } = Vector.toList { val := b :: y, property := hy }
n: โ„•

a: Bool

x: List Bool

hx: List.length (a :: x) = n + 1

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

h: Bitvec.toInt { val := a :: x, property := hx } = Bitvec.toInt { val := b :: y, property := hy }

{ val := a :: x, property := hx } = { val := b :: y, property := hy }
n: โ„•

x: List Bool

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

hx: List.length (false :: x) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif b then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := b :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := b :: y, property := hy }))

a.false
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := b :: y, property := hy }
n: โ„•

x: List Bool

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

hx: List.length (true :: x) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif b then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := b :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := b :: y, property := hy }))

a.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := b :: y, property := hy }
n: โ„•

a: Bool

x: List Bool

hx: List.length (a :: x) = n + 1

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

h: (bif a then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := a :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := a :: x, property := hx }))) =   bif b then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := b :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := b :: y, property := hy }))

a
Vector.toList { val := a :: x, property := hx } = Vector.toList { val := b :: y, property := hy }
n: โ„•

x: List Bool

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

hx: List.length (false :: x) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif b then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := b :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := b :: y, property := hy }))

a.false
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := b :: y, property := hy }
n: โ„•

x: List Bool

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

hx: List.length (true :: x) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif b then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := b :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := b :: y, property := hy }))

a.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := b :: y, property := hy }
n: โ„•

a: Bool

x: List Bool

hx: List.length (a :: x) = n + 1

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

h: (bif a then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := a :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := a :: x, property := hx }))) =   bif b then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := b :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := b :: y, property := hy }))

a
Vector.toList { val := a :: x, property := hx } = Vector.toList { val := b :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.false.false
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.false.true
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

a: Bool

x: List Bool

hx: List.length (a :: x) = n + 1

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

h: Bitvec.toInt { val := a :: x, property := hx } = Bitvec.toInt { val := b :: y, property := hy }

{ val := a :: x, property := hx } = { val := b :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.false.false
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.false.false
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.false.true
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.true.false
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: Bitvec.toNat { val := x, property := (_ : Nat.pred (List.length (false :: x)) = Nat.pred (Nat.succ (n + 0))) } =   Bitvec.toNat { val := y, property := (_ : Nat.pred (List.length (false :: y)) = Nat.pred (Nat.succ (n + 0))) }

a.false.false
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.false.false
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.false.true
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.true.false
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (Vector.toList โˆ˜ Bitvec.ofNat n)
    (Bitvec.toNat { val := x, property := (_ : Nat.pred (List.length (false :: x)) = Nat.pred (Nat.succ (n + 0))) }) =   (Vector.toList โˆ˜ Bitvec.ofNat n)
    (Bitvec.toNat { val := y, property := (_ : Nat.pred (List.length (false :: y)) = Nat.pred (Nat.succ (n + 0))) })

a.false.false
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.false.false
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.false.true
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.true.false
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
Goals accomplished! ๐Ÿ™
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.false.true
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.true.false
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

a: Bool

x: List Bool

hx: List.length (a :: x) = n + 1

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

h: Bitvec.toInt { val := a :: x, property := hx } = Bitvec.toInt { val := b :: y, property := hy }

{ val := a :: x, property := hx } = { val := b :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.false.true
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (false :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.false.true
Vector.toList { val := false :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.true.false
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
Goals accomplished! ๐Ÿ™
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.true.false
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

a: Bool

x: List Bool

hx: List.length (a :: x) = n + 1

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

h: Bitvec.toInt { val := a :: x, property := hx } = Bitvec.toInt { val := b :: y, property := hy }

{ val := a :: x, property := hx } = { val := b :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.true.false
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (false :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif false then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := false :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := false :: y, property := hy }))

a.true.false
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := false :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
Goals accomplished! ๐Ÿ™
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

a: Bool

x: List Bool

hx: List.length (a :: x) = n + 1

b: Bool

y: List Bool

hy: List.length (b :: y) = n + 1

h: Bitvec.toInt { val := a :: x, property := hx } = Bitvec.toInt { val := b :: y, property := hy }

{ val := a :: x, property := hx } = { val := b :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: Bitvec.toNat
    (Bitvec.not { val := x, property := (_ : Nat.pred (List.length (true :: x)) = Nat.pred (Nat.succ (n + 0))) }) =   Bitvec.toNat
    (Bitvec.not { val := y, property := (_ : Nat.pred (List.length (true :: y)) = Nat.pred (Nat.succ (n + 0))) })

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (Vector.toList โˆ˜ Bitvec.ofNat n)
    (Bitvec.toNat
      (Bitvec.not { val := x, property := (_ : Nat.pred (List.length (true :: x)) = Nat.pred (Nat.succ (n + 0))) })) =   (Vector.toList โˆ˜ Bitvec.ofNat n)
    (Bitvec.toNat
      (Bitvec.not { val := y, property := (_ : Nat.pred (List.length (true :: y)) = Nat.pred (Nat.succ (n + 0))) }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
n: โ„•

x, y: List Bool

hx: List.length (true :: x) = n + 1

hy: List.length (true :: y) = n + 1

h: (bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: x, property := hx })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: x, property := hx }))) =   bif true then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail { val := true :: y, property := hy })))
  else โ†‘(Bitvec.toNat (Vector.tail { val := true :: y, property := hy }))

a.true.true
Vector.toList { val := true :: x, property := hx } = Vector.toList { val := true :: y, property := hy }
Goals accomplished! ๐Ÿ™
Goals accomplished! ๐Ÿ™


theorem 
toInt_zero: โˆ€ {w : โ„•}, Bitvec.toInt 0 = 0
toInt_zero {
w: โ„•
w : 
Nat: Type
Nat} : (
0: ?m.347902
0 : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w).
toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
toInt = 
0: ?m.347934
0 := 
Goals accomplished! ๐Ÿ™
w: โ„•

Bitvec.toInt 0 = 0
w: โ„•

(match w, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
w: โ„•

Bitvec.toInt 0 = 0
zero
(match Nat.zero, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
w: โ„•

succ
(match Nat.succ w, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
w: โ„•

Bitvec.toInt 0 = 0
zero
(match Nat.zero, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
zero
(match Nat.zero, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
w: โ„•

succ
(match Nat.succ w, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
Goals accomplished! ๐Ÿ™
w: โ„•

Bitvec.toInt 0 = 0
w: โ„•

succ
(match Nat.succ w, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
w: โ„•

succ
(match Nat.succ w, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
w: โ„•

this: Vector.head 0 = false

succ
(match Nat.succ w, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
w: โ„•

succ
(match Nat.succ w, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
w: โ„•

thisโœ: Vector.head 0 = false

this: Vector.tail 0 = 0

succ
(match Nat.succ w, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
w: โ„•

succ
(match Nat.succ w, 0 with
  | 0, x => 0
  | Nat.succ n, v =>
    bif Vector.head v then Int.negSucc (Bitvec.toNat (Bitvec.not (Vector.tail v)))
    else โ†‘(Bitvec.toNat (Vector.tail v))) =   0
Goals accomplished! ๐Ÿ™


@[simp]
theorem 
toInt_eq_zero: โˆ€ {w : โ„•} (b : Bitvec w), Bitvec.toInt b = 0 โ†” b = 0
toInt_eq_zero {
w: โ„•
w : 
Nat: Type
Nat} (
b: Bitvec w
b : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w) : 
b: Bitvec w
b.
toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
toInt = 
0: ?m.350602
0 โ†” 
b: Bitvec w
b = 
0: ?m.350628
0 := 
Goals accomplished! ๐Ÿ™
w: โ„•

b: Bitvec w

Bitvec.toInt b = 0 โ†” b = 0
w: โ„•

b: Bitvec w

Bitvec.toInt b = 0 โ†” b = 0
w: โ„•

b: Bitvec w

Bitvec.toInt b = 0 โ†” Bitvec.toInt b = Bitvec.toInt 0
w: โ„•

b: Bitvec w

Bitvec.toInt b = 0 โ†” b = 0
w: โ„•

b: Bitvec w

Bitvec.toInt b = 0 โ†” Bitvec.toInt b = 0
Goals accomplished! ๐Ÿ™


theorem 
toInt_one: โˆ€ {w : โ„•}, 1 < w โ†’ Bitvec.toInt 1 = 1
toInt_one : โˆ€ {
w: โ„•
w : 
โ„•: Type
โ„•} (
_hw: 1 < w
_hw : 
1: ?m.350738
1 < 
w: โ„•
w), 
Bitvec.toInt: {n : โ„•} โ†’ Bitvec n โ†’ โ„ค
Bitvec.toInt (
1: ?m.350777
1 : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w) = 
1: ?m.350802
1 
  | 
w: โ„•
w+2, _ => 
Goals accomplished! ๐Ÿ™
w: โ„•

xโœ: 1 < w + 2

Bitvec.toInt 1 = 1
w: โ„•

xโœ: 1 < w + 2

this: Vector.head 1 = false

Bitvec.toInt 1 = 1
w: โ„•

xโœ: 1 < w + 2

Bitvec.toInt 1 = 1
w: โ„•

xโœ: 1 < w + 2

thisโœ: Vector.head 1 = false

this: Vector.tail 1 = 1

Bitvec.toInt 1 = 1
w: โ„•

xโœ: 1 < w + 2

Bitvec.toInt 1 = 1
Goals accomplished! ๐Ÿ™


-- from InstCombine/:805
theorem 
Warning: declaration uses 'sorry'
 {
w: โ„•
w : 
Nat: Type
Nat} {
x: Bitvec w
x : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w} (
hw: w > 1
hw : 
w: โ„•
w > 
1: ?m.353519
1) (
hx: x โ‰  0
hx : 
x: Bitvec w
x โ‰  
0: ?m.353552
0) :
  
Bitvec.sdiv?: {w : โ„•} โ†’ Bitvec w โ†’ Bitvec w โ†’ Option (Bitvec w)
Bitvec.sdiv? 
1: ?m.353580
1 
x: Bitvec w
x = 
Option.some: {ฮฑ : Type ?u.353603} โ†’ ฮฑ โ†’ Option ฮฑ
Option.some (
Bitvec.select: {w : โ„•} โ†’ Bitvec 1 โ†’ Bitvec w โ†’ Bitvec w โ†’ Bitvec w
Bitvec.select 
    (((
x: Bitvec w
x + 
1: ?m.353616
1).
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat < 
3: ?m.353692
3) ::แตฅ 
Vector.nil: {ฮฑ : Type ?u.353744} โ†’ Vector ฮฑ 0
Vector.nil) 
x: Bitvec w
x 
0: ?m.353747
0) := 
Goals accomplished! ๐Ÿ™
w: โ„•

x: Bitvec w

hw: w > 1

hx: x โ‰  0

sdiv? 1 x = some (select (decide (Bitvec.toNat (x + 1) < 3) ::แตฅ Vector.nil) x 0)
w: โ„•

x: Bitvec w

hw: w > 1

hx: x โ‰  0

sdiv? 1 x = some (select (decide (Bitvec.toNat (x + 1) < 3) ::แตฅ Vector.nil) x 0)
Goals accomplished! ๐Ÿ™
w: โ„•

x: Bitvec w

hw: w > 1

hx: x โ‰  0

w โ‰  0
x: Bitvec 0

hw: 0 > 1

hx: x โ‰  0

False
x: Bitvec 0

hw: 0 > 1

hx: x โ‰  0

False
w: โ„•

x: Bitvec w

hw: w > 1

hx: x โ‰  0

w โ‰  0
Goals accomplished! ๐Ÿ™
w: โ„•

x: Bitvec w

hw: w > 1

hx: x โ‰  0

sdiv? 1 x = some (select (decide (Bitvec.toNat (x + 1) < 3) ::แตฅ Vector.nil) x 0)
w: โ„•

x: Bitvec w

hw: w > 1

hx: x โ‰  0

hw0: w โ‰  0

(if 1 / Bitvec.toInt x < 2 ^ w then some (ofInt' w (1 / Bitvec.toInt x)) else none) =   some (if (Bitvec.toNat x + 1) % 2 ^ w < 3 then x else 0)
w: โ„•

x: Bitvec w

hw: w > 1

hx: x โ‰  0

sdiv? 1 x = some (select (decide (Bitvec.toNat (x + 1) < 3) ::แตฅ Vector.nil) x 0)
Goals accomplished! ๐Ÿ™


theorem 
Warning: declaration uses 'sorry'
 :
  (
Bitvec.sdiv?: {w : โ„•} โ†’ Bitvec w โ†’ Bitvec w โ†’ Option (Bitvec w)
Bitvec.sdiv? (
Bitvec.ofInt': (n : โ„•) โ†’ โ„ค โ†’ Bitvec n
Bitvec.ofInt' 
w: ?m.354618
w 
1: ?m.354646
1) 
x: ?m.354638
x) โŠ‘ 
  
Option.some: {ฮฑ : Type ?u.354649} โ†’ ฮฑ โ†’ Option ฮฑ
Option.some (
Bitvec.select: {w : โ„•} โ†’ Bitvec 1 โ†’ Bitvec w โ†’ Bitvec w โ†’ Bitvec w
Bitvec.select ((
Nat.blt: โ„• โ†’ โ„• โ†’ Bool
Nat.blt (
Bitvec.add: {n : โ„•} โ†’ Bitvec n โ†’ Bitvec n โ†’ Bitvec n
Bitvec.add 
x: ?m.354638
x (
Bitvec.ofNat: (n : โ„•) โ†’ โ„• โ†’ Bitvec n
Bitvec.ofNat 
w: ?m.354618
w 
1: ?m.354659
1)).
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat (
Bitvec.ofNat: (n : โ„•) โ†’ โ„• โ†’ Bitvec n
Bitvec.ofNat 
w: ?m.354618
w 
3: ?m.354669
3).
toNat: {n : โ„•} โ†’ Bitvec n โ†’ โ„•
toNat) ::แตฅ 
Vector.nil: {ฮฑ : Type ?u.354677} โ†’ Vector ฮฑ 0
Vector.nil)  
x: ?m.354638
x (
Bitvec.ofNat: (n : โ„•) โ†’ โ„• โ†’ Bitvec n
Bitvec.ofNat 
w: ?m.354618
w 
0: ?m.354680
0)) :=
  
sorry: ?m.354690
sorry

def 
beq: {w : โ„•} โ†’ Bitvec w โ†’ Bitvec w โ†’ Bool
beq {
w: โ„•
w : 
Nat: Type
Nat} (
x: Bitvec w
x 
y: Bitvec w
y : 
Bitvec: โ„• โ†’ Type
Bitvec 
w: โ„•
w) : 
Bool: Type
Bool := 
x: Bitvec w
x = 
y: Bitvec w
y

def 
fromBool: Bool โ†’ Bitvec 1
fromBool : 
Bool: Type
Bool โ†’ 
Bitvec: โ„• โ†’ Type
Bitvec 
1: ?m.354792
1 := fun 
b: ?m.354805
b => 
b: ?m.354805
b ::แตฅ 
Vector.nil: {ฮฑ : Type ?u.354812} โ†’ Vector ฮฑ 0
Vector.nil


instance: Coe Bool (Bitvec 1)
instance : 
Coe: semiOutParam (Sort ?u.354849) โ†’ Sort ?u.354848 โ†’ Sort (max(max1?u.354849)?u.354848)
Coe 
Bool: Type
Bool (
Bitvec: โ„• โ†’ Type
Bitvec 
1: ?m.354851
1) := โŸจ
fromBool: Bool โ†’ Bitvec 1
fromBoolโŸฉ

end Bitvec